1. Every circle graph with girth at least 5 is 3-colourable;Ageev;Discrete Math.,1999
2. High-girth graphs avoiding a minor are nearly bipartite;Galluccio;J. Comb. Theory. B,2001
3. F. Havet, R.J. Kang, T. Müller, J.-S. Sereni, Circular choosability, INRIA Sophia-Antipolis Technical Report RR-5957, 2006
4. Covering and coloring polygon-circle graphs;Kostochka;Discrete Math.,1997
5. Fractional Graph Theory: A Rational Approach to the Theory of Graphs;Scheinerman,1997