Total Colorings of Embedded Graphs with No 3-Cycles Adjacent to 4-Cycles
A total-k-coloring of a graph G is a coloring of V ∪ E using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ′′(G) of G is the smallest integer k such that G has a total-k-coloring. Let G be a graph embedded in a surface of Euler characteri...
| Published in: | Discussiones Mathematicae Graph Theory |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2018-11-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2058 |