scientific article; zbMATH DE number 5952517
From MaRDI portal
Publication:3170219
Recommendations
- On the vertex-distinguishing edge coloring of \(P_m\vee P_n\)
- On the vertex-distinguishing edge coloring of \(S_n \vee K_{n,n}\)
- D (2)-vertex distinguishing general edge colorings of graphs
- Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
- Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
- A general edge-coloring of \(mP_n\) which is vertex distinguished by multisets
- On the vertex-distinguishing total coloring of \(P_m\vee F_n\)
- scientific article; zbMATH DE number 5120880
- The \(D (2)\)-vertex-distinguishing proper edge-coloring chromatic number of \(C_m \cdot S_n\)
Cited in
(5)- General neighbour-distinguishing index via chromatic number
- The general neighbor-distinguishing edge coloring of strong products and compositions of graphs
- A general edge-coloring of \(mP_n\) which is vertex distinguished by multisets
- A note on general neighbor-distinguishing total coloring of graphs.
- The general neighbor-distinguishing chromatic index of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170219)
