ArticleOriginal scientific text
Title
Decompositions of quadrangle-free planar graphs
Authors 1, 2, 1, 3, 3
Affiliations
- Sobolev Institute of Mathematics, Novosibirsk 630090, Russia
- Yakutsk State University, Yakutsk, 677000, Russia
- Department of Mathematics, University of Illinois, Urbana, IL 61801, USA
Abstract
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and a graph with maximum degree at most 7. This degree restriction was improved to 6 by Borodin et al. We further lower this bound to 5 and show that it cannot be improved to 3.
Keywords
planar graphs, graph decompositions, quadrangle-free graphs
Bibliography
- 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).
- O.V. Borodin, Consistent colorings of graphs on the plane, Diskret. Analiz 45 (1987) 21-27 (in Russian).
- O. Borodin, A. Kostochka, N. Sheikh and G. Yu, Decomposing a planar graph with girth nine into a forest and a matching, European Journal of Combinatorics 29 (2008) 1235-1241, doi: 10.1016/j.ejc.2007.06.020.
- O. Borodin, A. Kostochka, N. Sheikh and G. Yu, M-degrees of quadrangle-free planar graphs, J. Graph Theory 60 (2009) 80-85, doi: 10.1002/jgt.20346.
- 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: 10.1002/jgt.10069.
- D.J. Kleitman, Partitioning the edges of a girth 6 planar graph into those of a forest and those of a set of disjoint paths and cycles, manuscript.
Pages:
87-99
Main language of publication
English
Received
2007-11-27
Accepted
2008-08-01
Published
2009
DOI: 10.7151/dmgt.1434
Exact and natural sciences