2-Distance Colorings of Integer Distance Graphs
A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. . ., k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number χ2(G) of G is then the smallest k for which G admits a 2-distance k-coloring. For any finite set...
Tallennettuna:
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
University of Zielona Góra
2019-05-01
|
| Sarja: | Discussiones Mathematicae Graph Theory |
| Aiheet: | |
| Linkit: | https://doi.org/10.7151/dmgt.2040 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|