Title of article
Covering planar graphs with forests
Author/Authors
Balogh، نويسنده , , Jَzsef and Kochol، نويسنده , , Martin and Pluhلr، نويسنده , , Andrلs and Yu، نويسنده , , Xingxing، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
12
From page
147
To page
158
Abstract
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.
Keywords
trees , Planar graphs , forests , Hamiltonian cycles , Outerplanar graphs , Graph Minors , series parallel graphs
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2005
Journal title
Journal of Combinatorial Theory Series B
Record number
1527559
Link To Document