Abstract
It is proved that a planar graph with maximum degree Δ ≥ 11 has total (vertex-edge) Chromatic number Δ + 1.
Original language | English (US) |
---|---|
Pages (from-to) | 53-59 |
Number of pages | 7 |
Journal | Journal of Graph Theory |
Volume | 26 |
Issue number | 1 |
DOIs | |
State | Published - Sep 1997 |
Externally published | Yes |
Keywords
- Discharging
- Planar graphs
- Total coloring
ASJC Scopus subject areas
- Geometry and Topology