The equitable total chromatic number of the graph HM(W_n)

DOI10.1007/BF02832320MaRDI QIDQ2454985zbMATH OpenFDO

Authors Jianxin Wei, Haiying 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)

Cites work

• scientific article; zbMATH DE number 840689 (Why is no real title available?)
• Equitable Coloring
• Equitable coloring and the maximum degree
• Equitable coloring of trees
• Equitable total coloring of graphs with maximum degree 3
• On equitable coloring of bipartite graphs

Cited in

(2)

• The equitable total chromatic number of \(S_m\vee S_n\)
• Equitable total chromatic number of splitting graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454985)