On the vertex-distinguishing proper edge-coloring of K₃,3 K_t
From MaRDI portal
Publication:4900977
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.
Cited in
(11)- On vertex-distinguishing edge colorings of graphs
- On the vertex-distinguishing proper edge-coloring of \(K_{3,4}\vee K_t\)
- 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]\)
- On vertex-distinguishing proper edge colorings of graphs satisfying the Ore condition.
- A note on the vertex-distinguishing proper edge coloring of graphs.
- Vertex-distinguishing proper edge-colorings
- scientific article; zbMATH DE number 2157279 (Why is no real title available?)
- Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
- scientific article; zbMATH DE number 2204182 (Why is no real title available?)
- Some conclusions of vertex-distinguishing edge coloring of product graphs
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)
