The total chromatic number of graphs having large maximum degree

DOI10.1016/0012-365X(93)90329-RzbMath0785.05035OpenAlexW2082080785WikidataQ126298553 ScholiaQ126298553MaRDI QIDQ686156

Anthony J. W. Hilton, H. R. F. Hind

Publication date: 13 April 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90329-r

zbMATH Keywords

total chromatic numbermaximum degreetotal colouring conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Generalization of two results of Hilton on total-colourings of a graph ⋮ Total coloring of certain classes of product graphs ⋮ \([r,s,t\)-colorings of graphs] ⋮ \([r,s,t\)-chromatic numbers and hereditary properties of graphs] ⋮ Total chromatic number of regular graphs of odd order and high degree ⋮ Total chromatic number of generalized Mycielski graphs ⋮ Total colorings-a survey ⋮ Total coloring conjecture on certain classes of product graphs ⋮ The total chromatic number of graphs of even order and high degree ⋮ Recent results on the total chromatic number ⋮ Total coloring of the prismatic graphs ⋮ The structure of totally critical graphs of odd order ⋮ The total chromatic number of regular graphs of high degree ⋮ The total chromatic number of regular graphs of even order and high degree ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs ⋮ Total chromatic number of graphs of odd order and high degree ⋮ Totally critical even order graphs ⋮ The total chromatic number of regular graphs whose complement is bipartite ⋮ Total coloring of quasi-line graphs and inflated graphs ⋮ Recent developments in total colouring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
• Determining the total colouring number is NP-hard
• Hamiltonism, degree sum and neighborhood intersections
• The total coloring of a multigraph with maximal degree 4
• Packing of graphs - a survey
• An upper bound for the total chromatic number
• On the total coloring of certain graphs
• The Total Chromatic Number of Graphs of High Minimum Degree
• An upper bound for the total chromatic number of dense graphs
• The Colour Numbers of Complete Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Complementary Graphs and Edge Chromatic Numbers
• On Total Chromatic Number of a Graph

This page was built for publication: The total chromatic number of graphs having large maximum degree