M-degrees of quadrangle-free planar graphs

DOI10.1002/jgt.20346zbMath1161.05024OpenAlexW4252916958WikidataQ60060260 ScholiaQ60060260MaRDI QIDQ3605161

Naeem N. Sheikh, Gexin Yu, Oleg V. Borodin, Alexandr V. Kostochka

Publication date: 20 February 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20346

zbMATH Keywords

decompositionplanar graphsdegreegame coloring

Mathematics Subject Classification ID

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

Related Items (4)

An extension of Kotzig's theorem ⋮ Generalized planar Turán numbers ⋮ Kernelization for cycle transversal problems ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27

Cites Work

• Structural theorem on plane graphs with application to the entire coloring number
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: M-degrees of quadrangle-free planar graphs