Vertex-distinguishing total coloring of some complement double graphs

MaRDI QIDQ3110582zbMATH OpenFDO

Authors Fei Wen, Zhiwen Wang, Hongjie Wang, Shitang Bao, Muchun Li, Zhongfu Zhang

Publication date 27 January 2012

zbMATH Keywords

complement double graphvertex distinguishing total chromatic numbervertex distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Adjacent vertex distinguishing total coloring of P_n and C_n double graph
• Vertex-distinguishing total coloring of graphs
• Vertex-distinguishing total coloring of \(K_{2n+1}\backslash E(K_{2,m})\)
• scientific article; zbMATH DE number 6010672
• Vertex-distinguishing total coloring of 2C_n

Cited in

(11)

• A note on graph proper total colorings with many distinguishing constraints
• General vertex-distinguishing total coloring of complete bipartite graphs.
• Vertex-distinguishing total coloring of some split graphs
• Vertex distinguishing total coloring of \(K_{2n+1}\backslash E (W_m)\)
• Vertex-distinguishing total coloring of ladder graphs \((n \equiv 6\pmod{8})\). VI
• scientific article; zbMATH DE number 5812180 (Why is no real title available?)
• The bound of the vertex-distinguishing total chromatic number of regular graphs
• A survey on not necessarily proper colorings under which certain pairs of vertices are distinguished by non-multiple color sets
• Vertex-distinguishing total chromatic number of \(S_m\times S_n,S_m\times F_n\) and \(S_m\times W_n\)
• scientific article; zbMATH DE number 6129492 (Why is no real title available?)
• scientific article; zbMATH DE number 7108902 (Why is no real title available?)

This page was built for publication: Vertex-distinguishing total coloring of some complement double graphs

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