Vertex-distinguishing total coloring of 2C_n
From MaRDI portal
Publication:4980993
zbMATH Open1299.05118MaRDI QIDQ4980993FDOQ4980993
Authors: Xiang'en Chen, Yanrong Ma 
Publication date: 30 June 2014
Recommendations
- On vertex-distinguishing total coloring of \(P_m\vee S_n\)
- On the vertex-distinguishing total coloring of \(P_m\vee F_n\)
- Vertex-distinguishing total coloring of graphs
- scientific article; zbMATH DE number 6129492
- Vertex-distinguishing total chromatic number of \(S_m\times S_n,S_m\times F_n\) and \(S_m\times W_n\)
Cited In (10)
- Algorithm on the optimal vertex-distinguishing total coloring of \(m{C_9}\)
- 2-distance vertex-distinguishing total coloring of graphs
- Vertex-distinguishing total chromatic number of \(S_m\times S_n,S_m\times F_n\) and \(S_m\times W_n\)
- General vertex-distinguishing total colorings of a family of unicyclic graphs including \({C_4}\)
- Vertex-distinguishing total coloring of ladder graphs \((n \equiv 6\pmod{8})\). VI
- On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)
- Vertex-distinguishing total coloring of some complement double graphs
- On the vertex-distinguishing total coloring of \(P_m\vee F_n\)
- On vertex-distinguishing total coloring of \(P_m\vee S_n\)
- Vertex-distinguishing total coloring of \(K_{2n+1}\backslash E(K_{2,m})\)
This page was built for publication: Vertex-distinguishing total coloring of \(2C_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4980993)
