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

zbMATH Open1313.05114MaRDI QIDQ2927196FDOQ2927196

Bing Yao, Xiang'en Chen

Publication date: 3 November 2014

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

zbMATH Keywords

complete graphsadjacent-vertex-distinguishing proper edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs 👍 👎
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four 👍 👎
• On the vertex-distinguishing proper edge-coloring of \(K_{3,4}\vee K_t\) 👍 👎
• Smarandachely adjacent vertex total coloring of the graph \(P_m + P_n\) 👍 👎
• The Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_3\vee K_n\) 👍 👎
• Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\)) 👍 👎

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)