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

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

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)

Cites Work

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

Cited In (10)

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

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)