The total coloring of \(K_5\)-minor-free graphs

DOI10.1016/J.EJC.2022.103510zbMath1486.05109arXiv2112.13334OpenAlexW4210780989MaRDI QIDQ2122692

Fan Yang, Jian Liang Wu

Publication date: 7 April 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.13334

zbMATH Keywords

total chromatic number\(K_5\)-minor-free graphstotal \(k\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites Work

• Unnamed Item
• Unnamed Item
• Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• Total coloring of embedded graphs of maximum degree at least ten
• On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
• The total chromatic number of any multigraph with maximum degree five is at most seven
• List edge and list total colourings of multigraphs
• The list chromatic index of a bipartite multigraph
• Total colourings of graphs
• Excluding a small minor
• The edge colorings of \(K_5\)-minor free graphs
• Total chromatic number of planar graphs with maximum degree ten
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• Total colorings of planar graphs with large maximum degree

This page was built for publication: The total coloring of \(K_5\)-minor-free graphs