An upper bound for the total chromatic number

DOI10.1007/BF01787726zbMath0725.05043MaRDI QIDQ2277479

Yanyan Li

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

total chromatic numberedge chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

The total chromatic number of any multigraph with maximum degree five is at most seven ⋮ Extending fixed vertex-colourings to total colourings ⋮ Some upper bounds on the total and list chromatic numbers of multigraphs ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ The total chromatic number of nearly complete bipartite graphs ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ List edge chromatic number of graphs with large girth ⋮ The total chromatic number of graphs having large maximum degree ⋮ Recent results on the total chromatic number ⋮ An upper bound for total colouring of graphs ⋮ An Improvement of Hind's Upper Bound on the Total Chromatic Number ⋮ A new upper bound for total colourings of graphs ⋮ Fractionally colouring total graphs ⋮ The total chromatic number of regular graphs whose complement is bipartite ⋮ Recent developments in total colouring

Cites Work

• Unnamed Item
• List-colourings of graphs
• The total coloring of a multigraph with maximal degree 4
• On the total coloring of certain graphs
• Nombre Chromatique Total Du Graphe R -Parti Complet
• The Colour Numbers of Complete Graphs

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