On the vertex-distinguishing edge coloring of K₂n - E(C₄)
From MaRDI portal
Publication:3014064
Recommendations
- 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\))
- 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 edge coloring of \(S_n \vee K_{n,n}\)
- scientific article; zbMATH DE number 5952559
Cited in
(12)- 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_4)\) (\(n\geq 12\))
- On the vertex-distinguishing edge coloring of \(S_n \vee K_{n,n}\)
- scientific article; zbMATH DE number 6531808 (Why is no real title available?)
- On the vertex-distinguishing proper edge-coloring of \(K_{3,4}\vee K_t\)
- scientific article; zbMATH DE number 5952559 (Why is no real title available?)
- 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,3}\vee K_t\)
- On the vertex-distinguishing edge coloring of join graph with star and complete balanced bipartite graph
- On the distinguishing proper edge colorings of several classes of complete 4-partite graphs
- Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_4\vee K_n\)
- scientific article; zbMATH DE number 2157279 (Why is no real title available?)
This page was built for publication: On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3014064)
