A bound on the chromatic number of an almost planar graph

DOI10.1007/s10958-014-1693-6zbMath1298.05130OpenAlexW2027777075MaRDI QIDQ744556

Gleb V. Nenashev

Publication date: 25 September 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-014-1693-6

zbMATH Keywords

graph drawing\(k\)-planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Graphs drawn with few crossings per edge
• The four-colour theorem
• Every Planar Map is Four Colorable
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: A bound on the chromatic number of an almost planar graph