Vertex-distinguishing edge coloring of K₂n E (F₄) (n 12)

MaRDI QIDQ2919752zbMATH OpenFDO

Authors Wantao Ning, Zhiwen Wang, Fei Wen, Jingwen Li, Hongjie Wang, Tingting Shi, Enqiang Zhu

Publication date 5 October 2012

Published in Mathematics in Practice and Theory (Search for Journal in Brave)

zbMATH Keywords

fanvertex distinguishing edge coloringcomplete graph of even ordervertex distinguishing edge chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
• scientific article; zbMATH DE number 5952559
• On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
• Vertex distinguishing edge coloring chromatic number of \(K_n-\{v_1v_2,v_3v_4,v_5v_6,v_7v_8\}\) (\(n \geqslant 20\), \(n \equiv 0 \pmod{2}\))
• On the vertex-distinguishing proper edge-coloring of \(K_{3,4}\vee K_t\)

Cited in

(6)

• On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
• scientific article; zbMATH DE number 5952559 (Why is no real title available?)
• scientific article; zbMATH DE number 2157279 (Why is no real title available?)
• Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_4\vee K_n\)
• Vertex distinguishing edge coloring chromatic number of \(K_n-\{v_1v_2,v_3v_4,v_5v_6,v_7v_8\}\) (\(n \geqslant 20\), \(n \equiv 0 \pmod{2}\))
• Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)

This page was built for publication: Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\))

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