Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.
Borodin, O.V. ; Ivanova, A.O. ; Stechkin, B.S.
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only], Tome 4 (2007), p. 296-299 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Publié le : 2007-01-01
EUDML-ID : urn:eudml:doc:53811 
@article{05263465,
     title = {Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.},
     journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
     volume = {4},
     year = {2007},
     pages = {296-299},
     zbl = {1132.05313},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05263465}
}

Borodin, O.V.; Ivanova, A.O.; Stechkin, B.S. Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.. Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only], Tome 4 (2007) pp. 296-299. http://gdmltest.u-ga.fr/item/05263465/