Definitions from Wikipedia (Linear arboricity)

▸ noun:  In graph theory, a branch of mathematics, the linear arboricity of an undirected graph is the smallest number of linear forests its edges can be partitioned into.


▸ Words similar to linear arboricity
▸ Usage examples for linear arboricity

▸ Idioms related to linear arboricity
▸ Wikipedia articles (New!)
▸ Words that often appear near linear arboricity
▸ Rhymes of linear arboricity

▸ Invented words related to linear arboricity