Adjacent vertex-distinguishing E-total coloring on product of graphs of some graphs
From MaRDI portal
Publication:3572166
zbMATH Open1212.05084MaRDI QIDQ3572166FDOQ3572166
Authors: Muchun Li, Zhongfu Zhang 
Publication date: 8 July 2010
Recommendations
- Adjacent vertex-distinguishing E-total coloring on the multiple join graphs of path and circle
- Adjacent-vertex-distinguishing total chromatic number of \(P_m\times K_n\)
- scientific article
- Adjacent vertex-distinguishing E-total coloring on the multiple join graph of wheel and path
- scientific article; zbMATH DE number 5812811
Cited In (14)
- On the adjacent vertex-distinguishing total coloring of two classes of product graphs
- Relation between Cartesian product and adjacent vertex distinguishing coloring
- Adjacent vertex distinguishing total coloring of Cartesian product of graphs
- The adjacent vertex distinguishing total coloring of extended Petersen graphs
- Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
- On adjacent-vertex-distinguishing total chromatic number of \(P_m \times F_n\) and \(C_m \times F_n\)
- The adjacent-vertex-distinguishing-equitable E-total coloring of the graphs \(C_{4,m}\) and \(C_{5,m}\)
- The adjacent-vertex-distinguishing-equitable \(E\)-total colorings of graphs \(W_{n,2}\) and \(F_{n,2}\)
- On the adjacent vertex strongly distinguishing \(E\)-total coloring of two special graphs
- A note on adjacent-vertex-distinguishing total chromatic numbers for \(P_m\times P_n, P_m\times C_n\) and \(C_m\times C_n\)
- Adjacent-vertex-distinguishing total chromatic number of \(P_m\times K_n\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Adjacent vertex-distinguishing E-total coloring on product of graphs of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3572166)
