Geodesic
Vertex coloring the square of outerplanar graphs of low degree
Discussiones Mathematicae. Graph Theory, Tome 30 (2010) no. 4, pp. 619-636

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

Vertex colorings of the square of an outerplanar graph have received a lot of attention recently. In this article we prove that the chromatic number of the square of an outerplanar graph of maximum degree Δ = 6 is 7. The optimal upper bound for the chromatic number of the square of an outerplanar graph of maximum degree Δ ≠ 6 is known. Hence, this mentioned chromatic number of 7 is the last and only unknown upper bound of the chromatic number in terms of Δ.
Keywords: outerplanar, chromatic number, power of a graph, weak dual 
@article{DMGT_2010_30_4_a7,
     author = {Agnarsson, Geir and Halld\'orsson, Magn\'us},
     title = {Vertex coloring the square of outerplanar graphs of low degree},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {619--636},
     publisher = {mathdoc},
     volume = {30},
     number = {4},
     year = {2010},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2010_30_4_a7/}
}
TY  - JOUR
AU  - Agnarsson, Geir
AU  - Halldórsson, Magnús
TI  - Vertex coloring the square of outerplanar graphs of low degree
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2010
SP  - 619
EP  - 636
VL  - 30
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2010_30_4_a7/
LA  - en
ID  - DMGT_2010_30_4_a7
ER  - 
%0 Journal Article
%A Agnarsson, Geir
%A Halldórsson, Magnús
%T Vertex coloring the square of outerplanar graphs of low degree
%J Discussiones Mathematicae. Graph Theory
%D 2010
%P 619-636
%V 30
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2010_30_4_a7/
%G en
%F DMGT_2010_30_4_a7
Agnarsson, Geir; Halldórsson, Magnús. Vertex coloring the square of outerplanar graphs of low degree. Discussiones Mathematicae. Graph Theory, Tome 30 (2010) no. 4, pp. 619-636. http://geodesic.mathdoc.fr/item/DMGT_2010_30_4_a7/