The total chromatic number of regular graphs of high degree

DOI10.1007/s11425-008-0149-1zbMath1197.05062OpenAlexW1979009921MaRDI QIDQ1042999

WanNian Yang, Dezheng Xie

Publication date: 7 December 2009

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-008-0149-1

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Total colorings-a survey

Cites Work

• Unnamed Item
• Unnamed Item
• The total chromatic number of graphs having large maximum degree
• The total coloring of a multigraph with maximal degree 4
• The total chromatic number of any multigraph with maximum degree five is at most seven
• The total chromatic number of graphs of even order and high degree
• Total colourings of graphs
• On total chromatic number of planar graphs without 4-cycles
• The total chromatic number of regular graphs of even order and high degree
• Total chromatic number of planar graphs with maximum degree ten
• On the total coloring of planar graphs.
• Total chromatic number of completer-partite graphs
• On total 9-coloring planar graphs of maximum degree seven
• The Colour Numbers of Complete Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph
• Some Theorems on Abstract Graphs