Geodesic
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 4 (2007), pp. 296-299 
O. V. Borodin; A. O. Ivanova; B. S. Stechkin. Decomposing a planar graph into a forest and a subgraph of restricted maximum degree. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 4 (2007), pp. 296-299. http://geodesic.mathdoc.fr/item/SEMR_2007_4_a18/
@article{SEMR_2007_4_a18,
     author = {O. V. Borodin and A. O. Ivanova and B. S. Stechkin},
     title = {Decomposing a~planar graph into a~forest and a~subgraph of restricted maximum degree},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {296--299},
     year = {2007},
     volume = {4},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2007_4_a18/}
}
TY  - JOUR
AU  - O. V. Borodin
AU  - A. O. Ivanova
AU  - B. S. Stechkin
TI  - Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2007
SP  - 296
EP  - 299
VL  - 4
UR  - http://geodesic.mathdoc.fr/item/SEMR_2007_4_a18/
LA  - en
ID  - SEMR_2007_4_a18
ER  - 
%0 Journal Article
%A O. V. Borodin
%A A. O. Ivanova
%A B. S. Stechkin
%T Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2007
%P 296-299
%V 4
%U http://geodesic.mathdoc.fr/item/SEMR_2007_4_a18/
%G en
%F SEMR_2007_4_a18

Voir la notice de l'article provenant de la source Math-Net.Ru

We disprove the conjecture of He, Hou, Lih, Shao, Wang and Zhu that every plane graph $G$ can be edge-partitioned into a forest and a subgraph of the maximum degree at most $\lceil\Delta(G)/2\rceil+1$.

[1] W. He, X. Hou, K. W. Lih, J. Shao, W. Wang, and X. Zhu, “Edge-partitions of planar graphs and their game coloring numbers”, J. Graph Theory, 41 (2002), 307–317 | DOI | MR | Zbl

[2] A. Bassa, J. Burns, J. Campbell, A. Deshpande, J. Farley, M. Halsey, S. Michalakis, P.-O. Persson, P. Pylyavskyy, L. Rademacher, A. Riehl, M. Rios, J. Samuel, B. Tenner, A. Vijayasaraty, L. Zhao, and D. J. Kleitman, Partitioning a Planar Graph of Girth Ten Into a Forest and a Matching, manuscript, 2004

[3] O. V. Borodin, A. V. Kostochka, N. N. Sheikh, and Gexin Yu, “Decomposing a planar graph with girth nine into a forest and a matching”, Europ. J. Combin. (to appear)

[4] O. V. Borodin, A. V. Kostochka, N. N. Sheikh, and Gexin Yu, $M$-degrees of $C_4$-free planar graphs, submitted