Six-Critical Graphs on the Klein Bottle
From MaRDI portal
Publication:5301014
DOI10.1016/j.endm.2008.06.047zbMath1267.05076OpenAlexW2006775616WikidataQ57601496 ScholiaQ57601496MaRDI QIDQ5301014
Nathan Chenette, Ken-ichi Kawarabayashi, Jan Kynčl, Bernard Lidický, Robin Thomas, Noah Streib, Luke Postle, Carl R. Yerger, Daniel Král'
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.047
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Five-coloring graphs on the Klein bottle
- The non-existence of colorings
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Five-coloring graphs on the torus
- The four-colour theorem
- Color-critical graphs on a fixed surface
- Every Planar Map is Four Colorable
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- Subgraph Isomorphism in Planar Graphs and Related Problems
- Map-Colour Theorems
- The Colouring of Maps
This page was built for publication: Six-Critical Graphs on the Klein Bottle