2-Distance Coloring of Planar Graphs with Specific Maximum Degree
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914262308356096 |
|---|---|
| author | Hajjar, Sara Al |
| author_facet | Hajjar, Sara Al |
| contents | A k-distance r-coloring of a graph is a coloring of the vertices of the graph such that if the distance between 2 vertices x and y is less or equal to k, then x and y must have distinct colors. A planar graph is a graph that can be drawn with no edge crossing. We will study the 2-distance coloring of planar graphs with maximum degree at least 6. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_10861 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | 2-Distance Coloring of Planar Graphs with Specific Maximum Degree Hajjar, Sara Al Combinatorics A k-distance r-coloring of a graph is a coloring of the vertices of the graph such that if the distance between 2 vertices x and y is less or equal to k, then x and y must have distinct colors. A planar graph is a graph that can be drawn with no edge crossing. We will study the 2-distance coloring of planar graphs with maximum degree at least 6. |
| title | 2-Distance Coloring of Planar Graphs with Specific Maximum Degree |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.10861 |