Author:
Zhao Yueying, ,Miao Lianying,
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference23 articles.
1. H. Grötzsch, Ein dreifarbensatz fur dreikreisfreie netze auf der kugel, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math. Nat. Reihe, 8 (1959), 109–120.
2. R. Steinberg, The state of the three color problem, Ann. Discrete Math., 55 (1993), 211–248.
3. O. V. Borodin, A. N. Glebov, A. Raspaud, M. R. Salavatipour, Planar graphs without cycles of length from 4 to 7 are 3-colorable, J. Combin. Theory Ser. B, 93 (2005), 303–311.
4. W. F. Wang, M. Chen, Planar graphs without 4, 6, 8-cycles are 3-colorable, Sci. China Math., 50 (2007), 1552–1562.
5. I. Choi, G. X. Yu, X. Zhang, Planar graphs with girth at least 5 are (3, 4)-colorable, Discrete Math., 342 (2019), 111577.