Smarandachely adjacent-vertex-distinguishing proper edge coloring of K₄ K_n

MaRDI QIDQ2927196zbMATH OpenFDO

Authors Xiang'en Chen, Bing Yao

Publication date 3 November 2014

Published in Chinese Quarterly Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacent-vertex-distinguishing proper edge coloringcomplete graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_3\vee K_n\)
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On the vertex-distinguishing proper edge-coloring of \(K_{3,4}\vee K_t\)
• On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
• Smarandachely adjacent vertex total coloring of the graph P_m + P_n
• The Smarandachely adjacent-vertex-edge colorings of some Mycielski's graphs
• Bounds of Smarandachely adjacent vertex edge coloring of graphs
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
• Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\))
• scientific article; zbMATH DE number 2157279

Cited in

(4)

• The Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_3\vee K_n\)
• On the Smarandachely-adjacent-vertex edge coloring of some double graphs
• Smarandachely adjacent vertex edge of graph P_m+P_n
• Bounds of Smarandachely adjacent vertex edge coloring of graphs

This page was built for publication: Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_4\vee K_n\)

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