Total Colorings of Planar Graphs with Large Maximum Degree

O. V. Borodin, A. V. Kostochka, D. R. Woodall

Research output: Contribution to journalArticlepeer-review

Abstract

It is proved that a planar graph with maximum degree Δ ≥ 11 has total (vertex-edge) Chromatic number Δ + 1.

Original languageEnglish (US)
Pages (from-to)53-59
Number of pages7
JournalJournal of Graph Theory
Volume26
Issue number1
DOIs
StatePublished - Sep 1997
Externally publishedYes

Keywords

  • Discharging
  • Planar graphs
  • Total coloring

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint

Dive into the research topics of 'Total Colorings of Planar Graphs with Large Maximum Degree'. Together they form a unique fingerprint.

Cite this