Five-coloring graphs on the Klein bottle

Authors:
Nathan Chenette;Luke Postle;Noah Streib;Robin Thomas;Carl Yerger
Affiliations:
School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA;School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA;School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA;School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA;School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA
Venue:
Journal of Combinatorial Theory Series B
Year:
2012

Citing 10
Cited 0

Five-coloring graphs on the torus

Journal of Combinatorial Theory Series B
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Color-critical graphs on a fixed surface

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Some remarks on Hajós' conjecture

Journal of Combinatorial Theory Series B
Graphs, Algorithms and Optimization

Graphs, Algorithms and Optimization
Triangulations and the Hajós conjecture

Journal of Graph Theory
6-Critical Graphs on the Klein Bottle

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We exhibit an explicit list of nine graphs such that a graph drawn in the Klein bottle is 5-colorable if and only if it has no subgraph isomorphic to a member of the list.