Vertex-distinguishing total coloring of ladder graphs (n 68). VI

MaRDI QIDQ2919740zbMATH OpenFDO

Authors Wei Zhang, Zhiwen Wang, Fei Wen, Shitang Bao, Muchun Li

Publication date 5 October 2012

Published in Mathematics in Practice and Theory (Search for Journal in Brave)

zbMATH Keywords

ladder graphtriangle sequencevertex distinguishing total chromatic numbervertex distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Vertex-distinguishing total coloring of ladder graphs (\(n\equiv 2\pmod{8}\))
• Vertex-distinguishing total chromatic number of \(S_m\times S_n,S_m\times F_n\) and \(S_m\times W_n\)
• Vertex-distinguishing total coloring of some complement double graphs
• On vertex-distinguishing total coloring of P_m S_n
• Vertex-distinguishing total coloring of 2C_n

Cited in

(1)

• Vertex-distinguishing total coloring of ladder graphs (\(n\equiv 2\pmod{8}\))

This page was built for publication: Vertex-distinguishing total coloring of ladder graphs \((n \equiv 6\pmod{8})\). VI

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