Vertex-distinguishing edge chromatic numbers of M(P_m) and M(C_m)
From MaRDI portal
Publication:4901083
Recommendations
- On the vertex-distinguishing edge chromatic number of P_m W_n
- On the vertex-distinguishing edge coloring of P_m P_n
- Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
- On vertex-distinguishing-equitable edge chromatic numbers of M(S_n) and M(F_n) graphs
- The D (2)-vertex-distinguishing proper edge-coloring chromatic number of C_m S_n
Cited in
(5)- On vertex-distinguishing-equitable edge chromatic numbers of M(S_n) and M(F_n) graphs
- scientific article; zbMATH DE number 5811658 (Why is no real title available?)
- A general edge-coloring of mP_n which is vertex distinguished by multisets
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
- Vertex distinguishing edge coloring of a hexagonal system
This page was built for publication: Vertex-distinguishing edge chromatic numbers of \({\mathcal M}(P_m)\) and \({\mathcal M}(C_m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901083)
