An upper bound for the total chromatic number of dense graphs

DOI10.1002/JGT.3190160302MaRDI QIDQ4013421zbMATHOpenAlexFDO

Authors

Publication date 27 September 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190160302

zbMATH Keywords

upper boundtotal chromatic numberdense graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• An upper bound for the total chromatic number
• A bound on the total chromatic number
• scientific article; zbMATH DE number 742644
• An upper bound for total colouring of graphs
• scientific article; zbMATH DE number 798659

Cited in

(14)

• Recent developments in total colouring
• Coloring Graphs with Dense Neighborhoods
• Some colouring problems for Paley graphs
• A dualistic approach to bounding the chromatic number of a graph
• Extending fixed vertex-colourings to total colourings
• Some upper bounds on the total and list chromatic numbers of multigraphs
• The total chromatic number of graphs having large maximum degree
• An upper bound for total colouring of graphs
• Recent results on the total chromatic number
• scientific article; zbMATH DE number 169493 (Why is no real title available?)
• A new upper bound for total colourings of graphs
• Dense uniform hypergraphs have high list chromatic number
• Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs
• Generalization of two results of Hilton on total-colourings of a graph

This page was built for publication: An upper bound for the total chromatic number of dense graphs

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