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

DOI10.1007/BF02832320zbMATH Open1132.05025MaRDI QIDQ2454985FDOQ2454985

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

• Equitable coloring and the maximum degree
• Equitable total coloring of graphs with maximum degree 3
• Title not available (Why is that?)
• On equitable coloring of bipartite graphs
• Equitable Coloring
• Equitable coloring of trees

Cited In (2)

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

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)