Nonrepetitive edge-colorings of trees
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...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
2017-06-01
|
| Edice: | Discrete Mathematics & Theoretical Computer Science |
| Témata: | |
| On-line přístup: | https://dmtcs.episciences.org/2651/pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|