On the vertex-distinguishing proper edge-coloring of K₃,3 K_t

zbMATH Open1265.05228MaRDI QIDQ4900977FDOQ4900977

Authors: Zhiwen Wang, Xiang'en Chen, Bing Yao, Yuping Gao 

Publication date: 24 January 2013

Recommendations

• On the vertex-distinguishing proper edge-coloring of \(K_{3,4}\vee K_t\)
• On the vertex-distinguishing edge coloring of \(S_n \vee K_{n,n}\)
• Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
• On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
• A note on the vertex-distinguishing proper edge coloring of graphs.

zbMATH Keywords

proper edge coloringvertex-distinguishing proper edge chromatic numbervertex-distinguishing proper edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• On vertex-distinguishing edge colorings of graphs
• A note on the vertex-distinguishing proper edge coloring of graphs.
• On vertex-distinguishing proper edge colorings of graphs satisfying the Ore condition.
• Some conclusions of vertex-distinguishing edge coloring of product graphs
• Title not available (Why is that?)
• The Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_3\vee K_n\)
• Some explorations on the vertex-distinguishing proper edge-coloring of compositional graphs \(K_p[P_q]\)
• Title not available (Why is that?)
• Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
• On the vertex-distinguishing proper edge-coloring of \(K_{3,4}\vee K_t\)

This page was built for publication: On the vertex-distinguishing proper edge-coloring of \(K_{3,3}\vee K_t\)

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