Three-coloring Klein bottle graphs of girth five

Authors:
Robin Thomas;Barrett Walls
Affiliations:
School of Mathematics, Georgia Institute of Technology, Atlanta, GA;School of Mathematics, Georgia Institute of Technology, Atlanta, GA
Venue:
Journal of Combinatorial Theory Series B
Year:
2004

Citing 6
Cited 5

A 4-color theorem for the Klein bottle

Discrete Mathematics
Gro¨tzsch's 3-color theorem and its counterparts for the torus and the projective plane

Journal of Combinatorial Theory Series B
4-chromatic projective graphs

Journal of Graph Theory
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
The chromatic number of a graph of girth 5 on a fixed surface

Journal of Combinatorial Theory Series B
Graph Theory With Applications

Graph Theory With Applications

Three-coloring triangle-free planar graphs in linear time

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Decomposing a planar graph of girth 5 into an independent set and a forest

Journal of Combinatorial Theory Series B
Three-coloring triangle-free planar graphs in linear time

ACM Transactions on Algorithms (TALG)
5-Coloring Graphs with 4 Crossings

SIAM Journal on Discrete Mathematics
Short proofs of coloring theorems on planar graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that every graph of girth at least five which admits an embedding in the Klein bottle is 3-colorable. This solves a problem raised by Woodburn, and complements a result of Thomassen who proved the same for projective planar and toroidal graphs.