Density of 5/2-critical graphs

1. O. Borodin, S. G. Hartke, A. O. Ivanova, A. V. Kostochka and D. B. West: Circular (5,2)-coloring of sparse graphs, Sib. Elektron. Mat. Izv. 5 (2008), 417–426.

   MathSciNet  MATH  Google Scholar 

2. O. Borodin, S.-J. Kim, A. Kostochka and D. West: Homomorphisms from sparse graphs with large girth, Journal of Combinatorial Theory, Series B 90 (2004), 147–159.

   Article  MathSciNet  MATH  Google Scholar 

3. M. DeVos: Open problem garden: Mapping planar graphs to odd cycles http://www.openproblemgarden.org/op/mapping_planar_graphs_to_odd_cycles.

4. H. Grötzsch: Ein Dreifarbensatz für Dreikreisfreie Netze auf der Kugel, Math.Natur. Reihe 8 (1959), 109–120.

   MathSciNet  Google Scholar 

5. F. Jaeger: On circular ows in graphs, in: Finite and Infinite Sets (Eger, 1981), Colloq. Math. Soc. J. Bolyai, vol. 37, 1984, 391–402.

   Article  Google Scholar 

6. W. Klostermeyer and C. Q. Zhang: (2+ε)-coloring of planar graphs with large odd-girth, J. Graph Theory 33 (2000), 109–119.

   Article  MathSciNet  MATH  Google Scholar 

7. A. Kostochka and M. Yancey: Ore’s conjecture for k=4 and Grötzsch Theorem, Manuscript, 2012.

   MATH  Google Scholar 

8. O. Ore: The Four Color Problem, Academic Press, New York, 1967.

   MATH  Google Scholar 

9. A. Vince: Star chromatic number, Journal of Graph Theory 12 (1988), 551–559.

   Article  MathSciNet  MATH  Google Scholar 

10. X. Zhu: Circular chromatic number: a survey, Discrete Mathematics 229 (2001), 371–410.

    Article  MathSciNet  MATH  Google Scholar 

11. X. Zhu: Circular chromatic number of planar graphs of large odd girth, Electronic J. of Combinatorics 8 (2001), R25.

    MathSciNet  MATH  Google Scholar 

12. X. Zhu: Recent developments in circular colouring of graphs, in: Topics in discrete mathematics, Springer, 2006, 497–550.

    Chapter  Google Scholar 

Download references