M-degrees of quadrangle-free planar graphs

DOI10.1002/JGT.20346zbMATH Open1161.05024DBLPjournals/jgt/BorodinKSY09OpenAlexW4252916958WikidataQ60060260 ScholiaQ60060260MaRDI QIDQ3605161FDOQ3605161

Authors Naeem N. Sheikh, Gexin Yu, Oleg V. Borodin, Alexandr 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)

Recommendations

• Minimax degrees of quasiplanar graphs with no short cycles other than triangles
• Minimax degrees of quasiplane graphs without 4-faces
• Minmax degree of graphs (extended abstract)
• Edge-partitions of planar graphs and their game coloring numbers
• Radius two trees specify χ‐bounded classes

Cites work

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

Cited in

(10)

• scientific article; zbMATH DE number 5584780 (Why is no real title available?)
• Minimax degrees of quasiplanar graphs with no short cycles other than triangles
• Kernelization for cycle transversal problems
• Minimax degrees of quasiplane graphs without 4-faces
• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
• scientific article; zbMATH DE number 5525873 (Why is no real title available?)
• On the number of edges of quadrilateral-free graphs
• Maximum cardinality neighbourly sets in quadrilateral free graphs
• An extension of Kotzig's theorem
• Generalized planar Turán numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605161)