Vertex-distinguishing total chromatic number of S_m S_n,S_m F_n and S_m W_n

MaRDI QIDQ3570927zbMATH OpenFDO

Authors

Publication date 8 July 2010

zbMATH Keywords

Cartesian productvertex-distinguishing total chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On vertex-distinguishing total coloring of P_m S_n
• On the vertex-distinguishing total coloring of P_m F_n
• Vertex-distinguishing total coloring of some split graphs
• Vertex-distinguishing total coloring of 2C_n
• Vertex-distinguishing total coloring of some complement double graphs

Cited in

(9)

• Vertex distinguishing edge- and total-colorings of Cartesian and other product graphs.
• Vertex-distinguishing total coloring of some split graphs
• Vertex-distinguishing total coloring of ladder graphs \((n \equiv 6\pmod{8})\). VI
• scientific article; zbMATH DE number 5811658 (Why is no real title available?)
• On vertex-distinguishing total coloring of P_m S_n
• scientific article; zbMATH DE number 6129961 (Why is no real title available?)
• Vertex-distinguishing total coloring of 2C_n
• Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph
• On the vertex-distinguishing total coloring of P_m F_n

This page was built for publication: Vertex-distinguishing total chromatic number of \(S_m\times S_n,S_m\times F_n\) and \(S_m\times W_n\)

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