The chromatic number of a graph of girth 5 on a fixed surface
- 1 January 2003
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 87 (1) , 38-71
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A short list color proof of Grötzsch's theoremJournal of Combinatorial Theory, Series B, 2003
- Coloring graphs with fixed genus and girthTransactions of the American Mathematical Society, 1997
- Color-Critical Graphs on a Fixed SurfaceJournal of Combinatorial Theory, Series B, 1997
- 3-List-Coloring Planar Graphs of Girth 5Journal of Combinatorial Theory, Series B, 1995
- Grötzsch′s 3-Color Theorem and Its Counterparts for the Torus and the Projective PlaneJournal of Combinatorial Theory, Series B, 1994
- Every Planar Graph Is 5-ChoosableJournal of Combinatorial Theory, Series B, 1994
- Coloring Graphs without Short Non-bounding CyclesJournal of Combinatorial Theory, Series B, 1994
- Generating locally cyclic triangulations of surfacesJournal of Combinatorial Theory, Series B, 1992