An upper bound for the total chromatic number of dense graphs

DOI10.1002/JGT.3190160302zbMATH Open0767.05048OpenAlexW2000581481MaRDI QIDQ4013421FDOQ4013421

Author name not available (Why is that?)

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)

Cites Work

• Title not available (Why is that?)

Cited In (14)

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

   Recommendations

• An upper bound for the total chromatic number 👍 👎
• A bound on the total chromatic number 👍 👎
• Title not available (Why is that?) 👍 👎
• An upper bound for total colouring of graphs 👍 👎
• Title not available (Why is that?) 👍 👎

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)