Recent results on the total chromatic number

DOI10.1016/0012-365X(93)90167-RMaRDI QIDQ686483zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

upper boundstotal chromatic numberTotal Colouring Conjecture

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(14)

• The total chromatic number of split-indifference graphs
• scientific article; zbMATH DE number 827992 (Why is no real title available?)
• scientific article; zbMATH DE number 6988815 (Why is no real title available?)
• Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
• The total chromatic number of graphs having large maximum degree
• The total chromatic number of regular graphs whose complement is bipartite
• scientific article; zbMATH DE number 4134070 (Why is no real title available?)
• scientific article; zbMATH DE number 4108788 (Why is no real title available?)
• Total chromatic number of graphs of odd order and high degree
• Total chromatic number of regular graphs of odd order and high degree
• scientific article; zbMATH DE number 4079448 (Why is no real title available?)
• The total chromatic number of graphs of even order and high degree
• Not necessarily proper total colourings which are adjacent vertex distinguishing
• The total chromatic number of regular graphs of even order and high degree

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)