Total Coloring of Claw-Free Planar Graphs
A total coloring of a graph is an assignment of colors to both its vertices and edges so that adjacent or incident elements acquire distinct colors. Let Δ(G) be the maximum degree of G. Vizing conjectured that every graph has a total (Δ + 2)-coloring. This Total Coloring Conjecture remains open even...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2022-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2300 |