A note on Goldberg's conjecture on total chromatic numbers

Yan Cao, Guantao Chen, Guangming Jing

Research output: Contribution to journalArticlepeer-review

Abstract

Let (Formula presented.) be a multigraph with maximum degree (Formula presented.), chromatic index (Formula presented.), and total chromatic number (Formula presented.). The total coloring conjecture proposed by Behzad and Vizing, independently, states that (Formula presented.) for a multigraph (Formula presented.), where (Formula presented.) is the multiplicity of (Formula presented.). Moreover, Goldberg conjectured that (Formula presented.) if (Formula presented.) and noticed the conjecture holds when (Formula presented.) is an edge-chromatic critical graph. By assuming the Goldberg–Seymour conjecture, we show that (Formula presented.) if (Formula presented.) in this note. Consequently, (Formula presented.) if (Formula presented.) and (Formula presented.) has a spanning edge-chromatic critical subgraph.

Original languageEnglish (US)
JournalJournal of Graph Theory
DOIs
StateAccepted/In press - 2021

Keywords

  • chromatic index
  • chromatic number
  • total chromatic number

ASJC Scopus subject areas

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'A note on Goldberg's conjecture on total chromatic numbers'. Together they form a unique fingerprint.

Cite this