Recent results on the total chromatic number

DOI10.1016/0012-365X(93)90167-RzbMath0793.05059OpenAlexW2047464494MaRDI QIDQ686483

Anthony J. W. Hilton

Publication date: 10 August 1994

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

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

zbMATH Keywords

upper boundstotal chromatic numberTotal Colouring Conjecture

Mathematics Subject Classification ID

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

Related Items

Total chromatic number of regular graphs of odd order and high degree ⋮ The total chromatic number of graphs of even order and high degree ⋮ The total chromatic number of regular graphs of even order and high degree ⋮ Total chromatic number of graphs of odd order and high degree ⋮ The total chromatic number of regular graphs whose complement is bipartite ⋮ Not necessarily proper total colourings which are adjacent vertex distinguishing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The total chromatic number of graphs having large maximum degree
• A total-chromatic number analogue of Plantholt's theorem
• 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
• Critical star multigraphs
• Recent progress on edge-colouring graphs
• 1-factorizing regular graphs of high degree - an improved bound
• Two conjectures on edge-colouring
• Hamiltonism, degree sum and neighborhood intersections
• The total chromatic number of nearly complete bipartite graphs
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• Méthode et théorème général de coloration des aretes d'un multigraphe
• Total colouring regular bipartite graphs is NP-hard
• The total chromatic number of regular graphs whose complement is bipartite
• On total colourings of graphs
• An upper bound for the total chromatic number
• On Hamilton's ideals
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• The Total Chromatic Number of Graphs of High Minimum Degree
• The chromatic index of complete multipartite graphs
• An upper bound for the total chromatic number of dense graphs
• Some upper bounds on the total and list chromatic numbers of multigraphs
• Path-Partition Structures of Graphs and Digraphs
• Complementary Graphs and Edge Chromatic Numbers
• A Combinatorial Theorem with an Application to Latin Rectangles