On adjacent-vertex-distinguishing total chromatic number of P_m F_n and C_m F_n

zbMATH Open1240.05107MaRDI QIDQ3170159FDOQ3170159

Authors: Jishun Wang, Zhongfu Zhang 

Publication date: 29 September 2011

Recommendations

• Adjacent-vertex-distinguishing total chromatic number of \(P_m\times K_n\)
• Adjacent vertex distinguishing total coloring of Cartesian product of graphs
• On the adjacent vertex distinguishing total chromatic number \(C_m\times K_n\)
• Adjacent vertex-distinguishing E-total coloring on product of graphs of some graphs
• scientific article; zbMATH DE number 5631452

zbMATH Keywords

graphadjacent-vertex-distinguishing total coloringCartesion product graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cited In (6)

• Title not available (Why is that?)
• Adjacent vertex distinguishing total coloring of Cartesian product of graphs
• Title not available (Why is that?)
• On total chromatic number and adjacent strong edge chromatic number of \(C_m\times C_{5n}\)
• Adjacent-vertex-distinguishing total chromatic number of \(P_m\times K_n\)
• On the adjacent vertex distinguishing total chromatic number \(C_m\times K_n\)

This page was built for publication: On adjacent-vertex-distinguishing total chromatic number of \(P_m \times F_n\) and \(C_m \times F_n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170159)