A note on Goldberg's conjecture on total chromatic numbers

@article{Cao2021ANO,
  title={A note on Goldberg's conjecture on total chromatic numbers},
  author={Yan Cao and Guantao Chen and Guangming Jing},
  journal={Journal of Graph Theory},
  year={2021}
}
Let G = (V (G), E(G)) be a multigraph with maximum degree ∆(G), chromatic index χ′(G) and total chromatic number χ′′(G). The Total Coloring conjecture proposed by Behzad and Vizing, independently, states that χ′′(G) ≤ ∆(G) + μ(G) + 1 for a multigraph G, where μ(G) is the multiplicity of G. Moreover, Goldberg conjectured that χ′′(G) = χ′(G) if χ′(G) ≥ ∆(G) + 3 and noticed the conjecture holds when G is an edge-chromatic critical graph. By assuming the Goldberg-Seymour conjecture, we show that… Expand

References

SHOWING 1-10 OF 12 REFERENCES
On Multi‐Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
1. Introduction It is well known that the Petersen graph is not 3-edge-colourable; that is, if we regard its 1-factors as (0, l)-functions on the set of edges, the constant function 1 cannot beExpand
Edge-coloring of multigraphs: Recoloring technique
  • M. Goldberg
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1984
New upper and lower bounds for the chromatic index of a finite muitigraph are obtained. A complete description is given of multigraphs satisfying χ′ > 1/8(9ρ + 6) where χ′ and ρ denote the chromaticExpand
On the chromatic index and the cover index of a multigraph
The problem of determining bounds for the chromatics index and the cover index of a multigraph is considered. Results stated include (I) a bound for the cover index which is analogous to theExpand
SOME UNSOLVED PROBLEMS IN GRAPH THEORY
CONTENTSIntroduction § 1. Fundamental concepts § 2. Isomorphism problems § 3. Metric questions § 4. Thickness and genus of graph § 5. Colouring problems § 6. Parts with given propertiesReferences
On multigraphs of almost maximal chromatic class (russian)
  • Discret. Analiz
  • 1973
On multigraphs of almost maximal chromatic class (Russian)
  • Discrete Anal.
  • 1973
Some unsolved problems in graph theory, Uspehi Mat
  • Nauk
  • 1968
Graphs and Their Chromatic Numbers, ProQuest LLC
  • Ann Arbor, MI,
  • 1965
...
1
2
...