Title of article :
Decomposing a Planar Graph into Degenerate Graphs
Author/Authors :
Thomassen، نويسنده , , C.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1995
Abstract :
We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph, that is, a forest.
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B