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

zbMATH Open1265.05242MaRDI QIDQ2919752FDOQ2919752

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

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)

Cited In (2)

• Title not available (Why is that?)
• Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_4\vee K_n\)

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)