Non-repetitive 3-coloring of subdivided graphs.
Pezarski, Andrzej ; Zmarz, Michał
The Electronic Journal of Combinatorics [electronic only], Tome 16 (2009), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2009-01-01
EUDML-ID : urn:eudml:doc:130283 
@article{05576415,
     title = {Non-repetitive 3-coloring of subdivided graphs.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {16},
     year = {2009},
     zbl = {1165.05325},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05576415}
}

Pezarski, Andrzej; Zmarz, Michał. Non-repetitive 3-coloring of subdivided graphs.. The Electronic Journal of Combinatorics [electronic only], Tome 16 (2009) . http://gdmltest.u-ga.fr/item/05576415/