Total coloring of (sub)cubic Halin graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912980374913024 |
|---|---|
| author | Kardoš, František Matok, Matúš |
| author_facet | Kardoš, František Matok, Matúš |
| contents | Total coloring of a graph is a coloring of its vertices and edges such that adjacent or incident elements receive distinct colors. Total coloring conjecture (stipulating that the total chromatic number of a graph $G$ is at most $Δ(G)+2$) is known to be true for subcubic graphs -- five colors are always enough. However, deciding whether a total coloring with only four colors exists remains a difficult problem, even in the class of bipartite cubic graphs. We solve the problem completely for cubic and subcubic Halin graphs, proving that there are only finitely many such graphs requiring five colors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_23189 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Total coloring of (sub)cubic Halin graphs Kardoš, František Matok, Matúš Combinatorics Total coloring of a graph is a coloring of its vertices and edges such that adjacent or incident elements receive distinct colors. Total coloring conjecture (stipulating that the total chromatic number of a graph $G$ is at most $Δ(G)+2$) is known to be true for subcubic graphs -- five colors are always enough. However, deciding whether a total coloring with only four colors exists remains a difficult problem, even in the class of bipartite cubic graphs. We solve the problem completely for cubic and subcubic Halin graphs, proving that there are only finitely many such graphs requiring five colors. |
| title | Total coloring of (sub)cubic Halin graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2603.23189 |