Non-repetitive 3-coloring of subdivided graphs.
Pezarski, Andrzej; Zmarz, Michał
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper N15, 7 p.-Research Paper N15, 7 p.
- ISSN: 1077-8926
Access Full Article
topHow to cite
topPezarski, Andrzej, and Zmarz, Michał. "Non-repetitive 3-coloring of subdivided graphs.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper N15, 7 p.-Research Paper N15, 7 p.. <http://eudml.org/doc/130283>.
@article{Pezarski2009,
author = {Pezarski, Andrzej, Zmarz, Michał},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper N15, 7 p.-Research Paper N15, 7 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Non-repetitive 3-coloring of subdivided graphs.},
url = {http://eudml.org/doc/130283},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Pezarski, Andrzej
AU - Zmarz, Michał
TI - Non-repetitive 3-coloring of subdivided graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper N15, 7 p.
EP - Research Paper N15, 7 p.
LA - eng
UR - http://eudml.org/doc/130283
ER -
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.