Vertex-distinguishing total coloring of K₂n+1 E(K₂,m)
From MaRDI portal
Publication:2859945
Recommendations
- Vertex distinguishing total coloring of \(K_{2n+1}\backslash E (W_m)\)
- Vertex-distinguishing edge coloring of \(K_{2n}\backslash E(F_m)(n\geqslant 4, m\geqslant 2)\)
- Vertex-distinguishing total coloring of \(2C_n\)
- Vertex-distinguishing IE-total coloring and general-total coloring of \({K_{1,1,p}}, {K_{1,2,p}}\)
- On vertex-distinguishing total coloring of \(P_m\vee S_n\)
- Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\))
- On the vertex-distinguishing total coloring of \(P_m\vee F_n\)
- scientific article; zbMATH DE number 7266965
- On the adjacent vertex-distinguishing total coloring of \(K(r,2m)\)
- scientific article; zbMATH DE number 5631932
Cited in
(9)- scientific article; zbMATH DE number 5952559 (Why is no real title available?)
- General vertex-distinguishing total coloring of graphs
- Algorithm for proving a conjecture of vertex distinguishing total colorings of graphs
- scientific article; zbMATH DE number 7266965 (Why is no real title available?)
- On the defining number of (2n-2)-vertex colorings of K_n K_n
- Vertex-distinguishing total coloring of some complement double graphs
- Vertex-distinguishing total coloring of some split graphs
- Vertex-distinguishing colorings of graphs a survey of recent developments
- Vertex distinguishing total coloring of \(K_{2n+1}\backslash E (W_m)\)
This page was built for publication: Vertex-distinguishing total coloring of \(K_{2n+1}\backslash E(K_{2,m})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859945)
