scientific article; zbMATH DE number 5952559
From MaRDI portal
Publication:3170271
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\))
- On the vertex-distinguishing edge coloring of \(S_n \vee K_{n,n}\)
- Vertex-distinguishing total coloring of \(K_{2n+1}\backslash E(K_{2,m})\)
- Vertex distinguishing total coloring of \(K_{2n+1}\backslash E (W_m)\)
- On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
- On the vertex-distinguishing edge coloring of P_m P_n
- scientific article; zbMATH DE number 2157279
- Vertex-distinguishing general total coloring of \(K_{3,5,p}\)
- 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}\))
Cited in
(8)- Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\))
- A conjecture of a vertex-distinguishing edge coloring of graphs
- On the vertex-distinguishing edge coloring of \(K_{2n} - E(C_4)\)
- 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_m)(n\geqslant 4, m\geqslant 2)\)
- The edge-distinguishing chromatic number of spider graphs with three legs or bounded leg lengths
- Vertex induced \(k\)-edge coloring and vertex incident \(k\)-edge coloring of graphs
- Vertex-distinguishing colorings of graphs a survey of recent developments
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 Q3170271)
