Geodesic
Non-repetitive 3-coloring of subdivided graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We show that every graph can be subdivided in a way that the resulting graph can be colored without repetitions on paths using only 3 colors. This extends the result of Thue asserting the existence of arbitrarily long nonrepetitive strings over a 3-letter alphabet.
DOI : 10.37236/253
Classification : 05C15 
@article{10_37236_253,
     author = {Andrzej Pezarski and Micha{\l} Zmarz},
     title = {Non-repetitive 3-coloring of subdivided graphs},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/253},
     zbl = {1165.05325},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/253/}
}
TY  - JOUR
AU  - Andrzej Pezarski
AU  - Michał Zmarz
TI  - Non-repetitive 3-coloring of subdivided graphs
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/253/
DO  - 10.37236/253
ID  - 10_37236_253
ER  - 
%0 Journal Article
%A Andrzej Pezarski
%A Michał Zmarz
%T Non-repetitive 3-coloring of subdivided graphs
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/253/
%R 10.37236/253
%F 10_37236_253
Andrzej Pezarski; Michał Zmarz. Non-repetitive 3-coloring of subdivided graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/253

Cité par Sources :