Decompositions of quadrangle-free planar graphs

DOI10.7151/dmgt.1434zbMath1181.05034OpenAlexW2040449712WikidataQ60060262 ScholiaQ60060262MaRDI QIDQ5324105

Naeem N. Sheikh, Oleg V. Borodin, Alexandr V. Kostochka, Anna O. Ivanova

Publication date: 3 August 2009

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1434

zbMATH Keywords

planar graphsgraph decompositionsquadrangle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) ⋮ On the game coloring index of \(F^+\)-decomposable graphs ⋮ The game coloring number of planar graphs with a specific girth ⋮ The game coloring number of planar graphs with a given girth ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree