Nonrepetitive edge-colorings of trees
Discrete Mathematics & Theoretical Computer Science · 2017
DOI: 10.23638/dmtcs-19-1-18 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, 2017. Verfasst von A. Kündgen und 1 weiteren Autor:innen. Gefördert von: European Commission.
Abstract (Originalsprache)
A repetition is a sequence of symbols in which the first half is the same as the second half. An edge-coloring of a graph is repetition-free or nonrepetitive if there is no path with a color pattern that is a repetition. The minimum number of colors so that a graph has a nonrepetitive edge-coloring is called its Thue edge-chromatic number. We improve on the best known general upper bound of $4\Delta-4$ for the Thue edge-chromatic number of trees of maximum degree $\Delta$ due to Alon, Grytczuk, Ha{\l}uszczak and Riordan (2002) by providing a simple nonrepetitive edge-coloring with $3\Delta-2$ colors.
Förderung
- European Commission
Zitieren
APA
Kündgen, A., & Talbot, T. (2017). Nonrepetitive edge-colorings of trees. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.23638/dmtcs-19-1-18
Vancouver
Kündgen A, Talbot T. Nonrepetitive edge-colorings of trees. Discrete Mathematics & Theoretical Computer Science. 2017. doi:10.23638/dmtcs-19-1-18
BibTeX
@article{Kndgen2017,
author = {Kündgen, A. and Talbot, T.},
title = {Nonrepetitive edge-colorings of trees},
journal = {Discrete Mathematics & Theoretical Computer Science},
year = {2017},
doi = {10.23638/dmtcs-19-1-18}
}
EUVIMED