Vertex-distinguishing total coloring of K₂n+1 E(K₂,m)

zbMATH Open1289.05164MaRDI QIDQ2859945FDOQ2859945

Authors: Muchun Li, Fei Wen, Li Zhang 

Publication date: 19 November 2013

Published in: Acta Scientiarum Naturalium Universitatis Nankaiensis (Search for Journal in Brave)

Recommendations

• Vertex distinguishing total coloring of \(K_{2n+1}\backslash E (W_m)\)
• Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
• Vertex-distinguishing total coloring of \(2C_n\)
• Vertex-distinguishing IE-total coloring and general-total coloring of \({K_{1,1,p}}, {K_{1,2,p}}\)
• On vertex-distinguishing total coloring of \(P_m\vee S_n\)
• Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\))
• On the vertex-distinguishing total coloring of \(P_m\vee F_n\)
• scientific article; zbMATH DE number 7266965
• On the adjacent vertex-distinguishing total coloring of \(K(r,2m)\)
• scientific article

zbMATH Keywords

complete graph of odd ordervertex-distinguishing total chromatic numbervertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)
• Vertex-distinguishing total coloring of some complement double graphs
• Vertex-distinguishing total coloring of some split graphs
• Vertex-distinguishing colorings of graphs a survey of recent developments
• Vertex distinguishing total coloring of \(K_{2n+1}\backslash E (W_m)\)

This page was built for publication: Vertex-distinguishing total coloring of \(K_{2n+1}\backslash E(K_{2,m})\)

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