论文信息 - Covering planar graphs with forests

Covering planar graphs with forests

We study the problem of covering graphs with trees and a graph of bounded maximum degree. By a classical theorem of Nash-Williams, every planar graph can be covered by three trees. We show that every planar graph can be covered by two trees and a forest, and the maximum degree of the forest is at most 8. Stronger results are obtained for some special classes of planar graphs.

[1] R. Duffin. Topology of series-parallel networks , 1965 .

[2] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[3] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .

[4] C. Nash-Williams. Decomposition of Finite Graphs Into Forests , 1964 .

[5] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[6] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .