On the adjacent vertex-distinguishing total coloring of two classes of product graphs

zbMATH Open1150.05345MaRDI QIDQ3516488FDOQ3516488

Authors Shuangliang Tian, Ping Chen 

Publication date 6 August 2008

zbMATH Keywords

product graphsadjacent vertex-distinguishing total chromatic numberadjacent vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• 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\)
• Adjacent vertex-distinguishing E-total coloring on product of graphs of some graphs
• Adjacent vertex distinguishing total coloring of Cartesian product of graphs
• scientific article; zbMATH DE number 5631452

Cited In (5)

• Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
• Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

This page was built for publication: On the adjacent vertex-distinguishing total coloring of two classes of product graphs

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