On a Heawood-type problem for maps with tangencies

DOI10.1007/s10958-016-2699-zzbMath1339.05143OpenAlexW2301281094MaRDI QIDQ291171

Gleb V. Nenashev

Publication date: 7 June 2016

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

Full work available at URL: https://doi.org/10.1007/s10958-016-2699-z

zbMATH Keywords

2-planar graphsmaximal chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Every Planar Map is Four Colorable
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: On a Heawood-type problem for maps with tangencies