H. L. Abbott and B. Zhou, On small faces in 4-critical graphs, Ars Combinatoria, vol.32, pp.203-207, 1991.

K. Appel and W. Haken, Every planar map is four colorable. Part I. Discharging, Illinois J. Math, vol.21, pp.429-490, 1977.
DOI : 10.1090/s0002-9904-1976-14122-5
URL : http://projecteuclid.org/download/pdf_1/euclid.bams/1183538218

K. Appel and W. Haken, Every planar map is four colorable. Part II, Reducibility Illinois J. Math, vol.21, pp.491-567, 1977.

O. V. Borodin, To the paper of H. L. Abbott and B. Zhou on 4-critical planar graphs, Ars Combinatoria, vol.43, pp.191-192, 1996.

O. V. Borodin, Structural properties of plane graphs without adjacent triangles and an application to 3-colorings, Journal of Graph Theory, vol.21, issue.2, pp.183-186, 1996.
DOI : 10.1002/(SICI)1097-0118(199602)21:2<183::AID-JGT7>3.0.CO;2-N

O. V. Borodin and A. N. Glebov, A sufficient condition for plane graphs to be 3-colorable. Diskret. analyz i issled, pp.3-11, 2004.

O. V. Borodin and A. N. , Glebov Planar graphs without 5-cycles and with minimum distance between triangles at least two are 3-colorable. Manuscript, 2008.

O. V. Borodin, A. N. Glebov, M. Montassier, and A. Raspaud, Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable, Journal of Combinatorial Theory, Series B, vol.99, issue.4, pp.668-673, 2009.
DOI : 10.1016/j.jctb.2008.11.001
URL : https://hal.archives-ouvertes.fr/hal-00349110

O. V. Borodin, A. N. Glebov, and A. R. Raspaud, Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable, Discrete Mathematics, vol.310, issue.20, 2009.
DOI : 10.1016/j.disc.2010.03.021

O. V. Borodin, A. N. Glebov, A. R. Raspaud, and M. R. Salavatipour, Planar graphs without cycles of length from 4 to 7 are 3-colorable, Journal of Combinatorial Theory, Series B, vol.93, issue.2, pp.303-311, 2005.
DOI : 10.1016/j.jctb.2004.11.001
URL : https://hal.archives-ouvertes.fr/hal-00307587

O. V. Borodin and A. Raspaud, A sufficient condition for planar graphs to be 3-colorable, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.17-27, 2003.
DOI : 10.1016/S0095-8956(03)00025-X
URL : https://hal.archives-ouvertes.fr/hal-00307586

Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang et al., On the 3-colorability of planar graphs without 4-, 7-, 9-cycles, Discrete Mathematics, vol.309, issue.13, pp.4596-4607, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00369723

M. Chen, X. Luo, and W. Wang, On 3-colorable planar graphs without cycles of four lengths, Information Processing Letters, vol.103, issue.4, pp.150-156, 2007.

M. Chen, A. Raspaud, and W. Wang, Three-coloring planar graphs without short cycles, Information Processing Letters, vol.101, issue.3, pp.134-138, 2007.
DOI : 10.1016/j.ipl.2006.08.009
URL : https://hal.archives-ouvertes.fr/hal-00293528

M. Chen and W. Wang, On 3-colorable planar graphs without prescribed cycles, Discrete Mathematics, vol.307, pp.2820-2825, 2007.

M. Chen and W. Wang, Planar graphs without 4, 6, 8-cycles are 3-colorable, Science in China Serie A: Mathematics, pp.1552-1562, 2007.

M. Chen and W. Wang, On 3-colorable planar graphs without short cycles, Applied Mathematics Letters, vol.21, issue.9, pp.961-965, 2008.
DOI : 10.1016/j.aml.2007.10.010
URL : http://doi.org/10.1016/j.aml.2007.10.010

N. Eaton and T. Hull, Defective list colorings of planar graphs, Bull. Inst. Combin. Appl, vol.25, pp.79-87, 1999.

M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976.
DOI : 10.1016/0304-3975(76)90059-1
URL : http://doi.org/10.1016/0304-3975(76)90059-1

H. Grötzsch, Ein dreifarbensatz für dreikreisfreie netze auf der kugel, Math.-Nat. Reihe, vol.8, pp.109-120, 1959.

M. R. Salavatipour, The Three Color Problem for planar graphs, 2002.

D. P. Sanders and Y. Zhao, A note on the three color problem, Graphs and Combinatorics, vol.55, issue.1, pp.91-94, 1995.
DOI : 10.1007/BF01787424

R. ?krekovski, List Improper Colourings of Planar Graphs, Combinatorics, Probability and Computing, vol.8, issue.3, pp.293-299, 1999.
DOI : 10.1017/S0963548399003752

R. Steinberg, The State of the Three Color Problem, Ann. Discrete Math, vol.55, pp.211-248, 1993.
DOI : 10.1016/S0167-5060(08)70391-1

L. Zhang and B. Wu, Three-coloring planar graphs without certain small cycles. Graph Theory Notes of, pp.27-30, 2004.

B. Xu, A 3-color Theorem on Plane Graphs without 5-circuits, Acta Mathematica Sinica, English Series, vol.20, issue.6, pp.1059-1062, 2007.
DOI : 10.1007/s10114-005-0851-7