The chromatic number of a graph of girth 5 on a fixed surface
From MaRDI portal
Publication:1403910
DOI10.1016/S0095-8956(02)00027-8zbMath1020.05030MaRDI QIDQ1403910
Publication date: 20 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Coloring-flow duality of embedded graphs, A short list color proof of Grötzsch's theorem, Three-coloring Klein bottle graphs of girth five
Cites Work
- Generating locally-cyclic triangulations of surfaces
- Coloring graphs without short non-bounding cycles
- Every planar graph is 5-choosable
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Color-critical graphs on a fixed surface
- 3-list-coloring planar graphs of girth 5
- Coloring graphs with fixed genus and girth
- Unnamed Item
- Unnamed Item
- Unnamed Item