The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\)

DOI10.1007/BF02832320zbMath1132.05025MaRDI QIDQ2454985

Jianxin Wei, Hai Ying Wang

Publication date: 22 October 2007

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

wheelequitable total chromatic numberequitable total coloringhypo-Mycielski graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Equitable total chromatic number of splitting graph

Cites Work

• Equitable coloring of trees
• Equitable coloring and the maximum degree
• Equitable total coloring of graphs with maximum degree 3
• On equitable coloring of bipartite graphs
• Equitable Coloring
• Unnamed Item

This page was built for publication: The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\)