Recent results on the total chromatic number

DOI10.1016/0012-365X(93)90167-RzbMATH Open0793.05059OpenAlexW2047464494MaRDI QIDQ686483FDOQ686483

Authors: A. 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

Recommendations

• The total chromatic number of graphs having large maximum degree
• scientific article; zbMATH DE number 4108788
• scientific article; zbMATH DE number 98760
• Recent developments in total colouring
• Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1

zbMATH Keywords

upper boundstotal chromatic numberTotal Colouring Conjecture

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Total chromatic number of graphs of odd order and high degree
• The total chromatic number of regular graphs whose complement is bipartite
• Title not available (Why is that?)
• The total chromatic number of graphs of even order and high degree
• Title not available (Why is that?)
• The total chromatic number of regular graphs of even order and high degree
• Total chromatic number of regular graphs of odd order and high degree
• The total chromatic number of graphs having large maximum degree
• Title not available (Why is that?)
• Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
• Not necessarily proper total colourings which are adjacent vertex distinguishing
• The total chromatic number of split-indifference graphs

This page was built for publication: Recent results on the total chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686483)