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...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Discrete Mathematics & Theoretical Computer Science
2017-06-01
|
| Serier: | Discrete Mathematics & Theoretical Computer Science |
| Fag: | |
| Online adgang: | https://dmtcs.episciences.org/2651/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|