The total chromatic number of any multigraph with maximum degree five is at most seven

Research output: Contribution to journalArticlepeer-review

Abstract

The result announced in the title is proved. A new proof of the total 6-colorability of any multigraph with maximum degree 4 is also given.

Original languageEnglish (US)
Pages (from-to)199-214
Number of pages16
JournalDiscrete Mathematics
Volume162
Issue number1-3
DOIs
StatePublished - Dec 25 1996
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'The total chromatic number of any multigraph with maximum degree five is at most seven'. Together they form a unique fingerprint.

Cite this