Weakening total coloring conjecture and Hadwiger's conjecture on total graphs

DOI10.37236/11032arXiv2107.09994MaRDI QIDQ6117407

Manu Basavaraju, Ankur Naskar, L. Sunil Chandran, Mathew C. Francis

Publication date: 19 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hadwiger's conjecture for 3-arc graphs
• Hadwiger's conjecture for powers of cycles and their complements
• Determining the total colouring number is NP-hard
• Hadwiger's conjecture for proper circular arc graphs
• List-colourings of graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The total coloring of a multigraph with maximal degree 4
• A bound on the total chromatic number
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Hadwiger's conjecture for squares of 2-trees
• Planar graphs of maximum degree seven are Class I
• Hadwiger's conjecture for line graphs
• Total colourings of graphs
• An upper bound for the total chromatic number
• On the total coloring of certain graphs
• Über eine Eigenschaft der ebenen Komplexe
• Hadwiger's Conjecture for the Complements of Kneser Graphs
• Hadwiger's conjecture for quasi-line graphs
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• A survey of χ‐boundedness
• The Colour Numbers of Complete Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph

This page was built for publication: Weakening total coloring conjecture and Hadwiger's conjecture on total graphs