Totally critical even order graphs

DOI10.1006/jctb.1999.1902zbMath0935.05043OpenAlexW2021132233MaRDI QIDQ1306315

H. R. F. Hind, G. M. Hamilton, Anthony J. W. Hilton

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1902

zbMATH Keywords

total chromatic numberdeficiencymaximum degreevertex-coloringedge independence numberconformability

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The structure of totally critical graphs of odd order

Cites Work

• The total chromatic number of graphs having large maximum degree
• A total-chromatic number analogue of Plantholt's theorem
• Determining the total colouring number is NP-hard
• 1-factorizing regular graphs of high degree - an improved bound
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Totally critical even order graphs