The equitable total chromatic number of S_m S_n
From MaRDI portal
Publication:2887196
zbMATH Open1249.05128MaRDI QIDQ2887196FDOQ2887196
Authors: Xiaomin Ma, Gang Ma 
Publication date: 1 June 2012
Published in: Journal of Suzhou University of Science and Technology. Natural Science Edition (Search for Journal in Brave)
Recommendations
- On the equitable total chromatic number of \(P_n\vee K_{m,n}\)
- The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\)
- Equitable total chromatic numbers of the square graphs of some graphs
- Equitable total coloring of \(C_m\square C_n\)
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
- Equitable edge chromatic number of \(P_m\otimes S_n^0\) and \(S_m^0\otimes S_n^0\)
- On equitable total-coloring of \(W_m \vee S_n\)
- Equitable total coloring of \(F_n \vee W_n\)
- Equitable chromatic number of complete multipartite graphs
- Equitable total chromatic number of splitting graph
Cited In (12)
- The equitable chromatic number of the total graph and central graph of a spider
- Title not available (Why is that?)
- On the equitable total chromatic number of \(P_n\vee K_{m,n}\)
- Title not available (Why is that?)
- An algorithmic approach to equitable total chromatic number of graphs
- Equitable total coloring of \(F_n \vee W_n\)
- Equitable total coloring of \(C_m\square C_n\)
- On equitable total-coloring of \(W_m \vee S_n\)
- Some conclusions of equitable total coloring of graph
- On the equitable total coloring of multiple join-graph
- On the equitable total coloring of some join-graphs
- Equitable total chromatic number of splitting graph
This page was built for publication: The equitable total chromatic number of \(S_m\vee S_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2887196)
