Five-coloring graphs on the Klein bottle

DOI10.1016/j.jctb.2012.05.001zbMath1251.05054arXiv1201.5361OpenAlexW2133720724MaRDI QIDQ713974

Robin Thomas, Nathan Chenette, Luke Postle, Noah Streib, Carl R. Yerger

Publication date: 19 October 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5361

zbMATH Keywords

graph coloringKlein bottle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. ⋮ Six-Critical Graphs on the Klein Bottle ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ 5-list coloring toroidal 6-regular triangulations in linear time ⋮ Irreducible 4-critical triangle-free toroidal graphs ⋮ Some Conjectures and Questions in Chromatic Topological Graph Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on Hajós' conjecture
• On critical subgraphs of colour-critical graphs
• 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
• Every planar graph is 5-choosable
• 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
• 6-Critical Graphs on the Klein Bottle
• Map-Colour Theorems
• The Colouring of Maps
• Triangulations and the Hajós conjecture
• Triangulations and the Hajós conjecture

This page was built for publication: Five-coloring graphs on the Klein bottle