Geodesic
Star coloring high girth planar graphs
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A star coloring of a graph is a proper coloring such that no path on four vertices is 2-colored. We prove that every planar graph with girth at least 9 can be star colored using 5 colors, and that every planar graph with girth at least 14 can be star colored using 4 colors; the figure 4 is best possible. We give an example of a girth 7 planar graph that requires 5 colors to star color.
DOI : 10.37236/848
Classification : 05C15, 05C10
Mots-clés : star coloring, planar graph coloring 
@article{10_37236_848,
     author = {Craig Timmons},
     title = {Star coloring high girth planar graphs},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/848},
     zbl = {1165.05326},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/848/}
}
TY  - JOUR
AU  - Craig Timmons
TI  - Star coloring high girth planar graphs
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/848/
DO  - 10.37236/848
ID  - 10_37236_848
ER  - 
%0 Journal Article
%A Craig Timmons
%T Star coloring high girth planar graphs
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/848/
%R 10.37236/848
%F 10_37236_848
Craig Timmons. Star coloring high girth planar graphs. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/848

Cité par Sources :