On vertex-distinguishing total coloring of P_m S_n
From MaRDI portal
Publication:3538751
Recommendations
- On the vertex-distinguishing total coloring of \(P_m\vee F_n\)
- Vertex-distinguishing total chromatic number of \(S_m\times S_n,S_m\times F_n\) and \(S_m\times W_n\)
- scientific article; zbMATH DE number 5811658
- Vertex-distinguishing total coloring of \(2C_n\)
- Vertex-distinguishing total coloring of some split graphs
Cited in
(11)- Algorithm on the optimal vertex-distinguishing total coloring of \(m{C_9}\)
- Vertex-distinguishing total chromatic number of \(S_m\times S_n,S_m\times F_n\) and \(S_m\times W_n\)
- Vertex-distinguishing total coloring of ladder graphs \((n \equiv 6\pmod{8})\). VI
- scientific article; zbMATH DE number 5834294 (Why is no real title available?)
- General vertex-distinguishing total colorings of corona graph of \(2{K_2} \vee {K_1}\)
- Vertex-distinguishing total coloring of \(2C_n\)
- On the vertex-distinguishing total coloring of \(P_m\vee F_n\)
- Vertex-distinguishing total coloring of some split graphs
- scientific article; zbMATH DE number 5811658 (Why is no real title available?)
- Vertex-distinguishing total coloring of \(K_{2n+1}\backslash E(K_{2,m})\)
- Vertex distinguishing total coloring of \(K_{2n+1}\backslash E (W_m)\)
This page was built for publication: On vertex-distinguishing total coloring of \(P_m\vee S_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3538751)
