Geodesic
Planar graphs without 4-, 5- and 8-cycles are 3-colorable
Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 4, pp. 775-789

Voir la notice de l'article provenant de la source Library of Science

In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable.
Keywords: 3-coloring, planar graph, discharging 
@article{DMGT_2011_31_4_a10,
     author = {Mondal, Sakib},
     title = {Planar graphs without 4-, 5- and 8-cycles are 3-colorable},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {775--789},
     publisher = {mathdoc},
     volume = {31},
     number = {4},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2011_31_4_a10/}
}
TY  - JOUR
AU  - Mondal, Sakib
TI  - Planar graphs without 4-, 5- and 8-cycles are 3-colorable
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2011
SP  - 775
EP  - 789
VL  - 31
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2011_31_4_a10/
LA  - en
ID  - DMGT_2011_31_4_a10
ER  - 
%0 Journal Article
%A Mondal, Sakib
%T Planar graphs without 4-, 5- and 8-cycles are 3-colorable
%J Discussiones Mathematicae. Graph Theory
%D 2011
%P 775-789
%V 31
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2011_31_4_a10/
%G en
%F DMGT_2011_31_4_a10
Mondal, Sakib. Planar graphs without 4-, 5- and 8-cycles are 3-colorable. Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 4, pp. 775-789. http://geodesic.mathdoc.fr/item/DMGT_2011_31_4_a10/