A total-chromatic number analogue of Plantholt's theorem

DOI10.1016/0012-365X(90)90031-CzbMath0714.05025OpenAlexW2074375635MaRDI QIDQ750449

Anthony J. W. Hilton

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90031-c

zbMATH Keywords

matchingedge-colouringBehzad conjecturetotal-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs ⋮ Generalization of two results of Hilton on total-colourings of a graph ⋮ On total coloring of some classes of regular graphs ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Total colorings-a survey ⋮ The total chromatic number of graphs of even order and high degree ⋮ The total chromatic number of split-indifference graphs ⋮ Colouring Powers of Paths ⋮ The total chromatic number of nearly complete bipartite graphs ⋮ Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) ⋮ Recent results on the total chromatic number ⋮ Fractionally total colouring \(G_{n,p}\) ⋮ Total chromatic number of one kind of join graphs ⋮ Total chromatic number of graphs of odd order and high degree ⋮ Totally critical even order graphs ⋮ The total chromatic number of regular graphs whose complement is bipartite

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A total-chromatic number analogue of Plantholt's theorem