Vertex distinguishing edge coloring chromatic number of K_n-\v₁v₂,v₃v₄,v₅v₆,v₇v₈\ (n 20, n 0 2)

zbMATH Open1240.05106MaRDI QIDQ3170913FDOQ3170913

Authors: Hongjie Wang, Zhiwen Wang, Fei Wen, Jingwen Li, Enqiang Zhu 

Publication date: 29 September 2011

Recommendations

• On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
• Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
• Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\))
• scientific article; zbMATH DE number 5952559
• scientific article; zbMATH DE number 2157279

zbMATH Keywords

edge coloringvertex-distinguishing edge coloringvertex-distinguishing edge chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\))
• 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 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}\))

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