An Improvement of Hind's Upper Bound on the Total Chromatic Number

DOI10.1017/S0963548300001899zbMath0862.05039WikidataQ59233517 ScholiaQ59233517MaRDI QIDQ4715258

Amanda G. Chetwynd, Roland Haeggkvist

Publication date: 19 May 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

upper boundchromatic indextotal chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The total chromatic number of any multigraph with maximum degree five is at most seven ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Total-coloring of sparse graphs with maximum degree 6

Cites Work

• Unnamed Item
• An upper bound for the total chromatic number
• Alternating hamiltonian cycles in two colored complete bipartite graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: An Improvement of Hind's Upper Bound on the Total Chromatic Number