Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)

DOI10.1007/BF02350630zbMath0771.05034OpenAlexW2000598303MaRDI QIDQ1196563

Hung-Lin Fu, Bor-Liang Chen

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1007/bf02350630

zbMATH Keywords

chromatic numbermaximum degreetotal colorings

Mathematics Subject Classification ID

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

Related Items (6)

Generalization of two results of Hilton on total-colourings of a graph ⋮ On total coloring of some classes of regular graphs ⋮ The total chromatic number of graphs of even order and high degree ⋮ Recent results on the total chromatic number ⋮ Total chromatic number of graphs of odd order and high degree ⋮ Totally critical even order graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A total-chromatic number analogue of Plantholt's theorem
• The total coloring of a multigraph with maximal degree 4
• On the total coloring of certain graphs
• Total Colourings of Graphs
• The Colour Numbers of Complete Graphs

This page was built for publication: Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)