On 2-distance 16-coloring of planar graphs with maximum degree at most five
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918127579693056 |
|---|---|
| author | Deniz, Zakir |
| author_facet | Deniz, Zakir |
| contents | A vertex coloring of a graph G is called a 2-distance coloring if any two vertices at a distance at most 2 from each other receive different colors. Suppose that G is a planar graph with a maximum degree at most 5. We prove that G admits a 2-distance 16 coloring, which improves the result given by Hou et al. (Graphs and Combinatorics 39:20, 2023). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_15899 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On 2-distance 16-coloring of planar graphs with maximum degree at most five Deniz, Zakir Combinatorics 05C15 A vertex coloring of a graph G is called a 2-distance coloring if any two vertices at a distance at most 2 from each other receive different colors. Suppose that G is a planar graph with a maximum degree at most 5. We prove that G admits a 2-distance 16 coloring, which improves the result given by Hou et al. (Graphs and Combinatorics 39:20, 2023). |
| title | On 2-distance 16-coloring of planar graphs with maximum degree at most five |
| topic | Combinatorics 05C15 |
| url | https://arxiv.org/abs/2310.15899 |