Isolated vertices are allowed, as are graphs with a single connected component. However, star graphs are not allowed as a subgraph (such as the claw in the second graph), and neither are cycles
According to Habib and Peroche, a k-linear forest consists of paths of k or fewer nodes each.[9]
According to Burr and Roberts, an (n, j)-linear forest has n vertices and j of its component paths have an odd number of vertices.[2]
According to Faudree et al., a (k, t)-linear or (k, t, s)-linear forest has kedges, and t components of which s are single vertices; s is omitted if its value is not critical.[10]
Derived concepts
The linear arboricity of a graph is the minimum number of linear forests into which the graph can be partitioned. For a graph of maximum degree , the linear arboricity is always at least , and it is conjectured that it is always at most .[11]
A linear coloring of a graph is a proper graph coloring in which the induced subgraph formed by each two colors is a linear forest. The linear chromatic number of a graph is the smallest number of colors used by any linear coloring. The linear chromatic number is at most proportional to , and there exist graphs for which it is at least proportional to this quantity.[12]
↑ Enomoto, Hikoe; Péroche, Bernard (1984), "The Linear Arboricity of Some Regular Graphs", Journal of Graph Theory, 8 (2): 309–324, doi:10.1002/jgt.3190080211
↑ de Verdière, Yves Colin (October 1990), "Sur un Nouvel Invariant des Graphes et un Critère de Planarité", Journal of Combinatorial Theory, Series B (in French), 50 (1), Academic Press, Inc.: 11–21, doi:10.1016/0095-8956(90)90093-F
↑ Clark, Curtis (1984), An Approach to Graph Achievement Games: Ultimately Economical Graphs (PhD thesis), Ann Arbor, Michigan: University of Michigan, p.55, ISBN979-8-204-34535-5, ProQuest303324911 (UMI 8502782) – via ProQuest Dissertations & Theses Global
↑ Habib, M.; Peroche, B. (1982), "Some problems about linear arboricity", Discrete Mathematics, 41 (2), North-Holland Publishing Company: 219–220, doi:10.1016/0012-365x(82)90209-6
This page is based on this Wikipedia article Text is available under the CC BY-SA 4.0 license; additional terms may apply. Images, videos and audio are available under their respective licenses.