Vertex-distinguishing E-total coloring of complete bipartite graph in which one part has 4 vertices.
From MaRDI portal
Publication:5206414
Recommendations
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{3,n}\) with \(n\geq 18\)
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(473\leq n<977\).
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(7 \leq n \leq 95\)
- Vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{9,n}}\) \((93 \le n \le 216)\)
- Vertex-distinguishing E-total coloring of complete bipartite graph \({K_{8,n}}\) with \({472 \le n \le 980}\)
Cited in
(4)- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{3,n}\) with \(n\geq 18\)
- Vertex-distinguishing E-total colorings of the graphs mC₃ and mC₄
- Vertex-distinguishing E-total colorings of graphs
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(473\leq n<977\).
This page was built for publication: Vertex-distinguishing E-total coloring of complete bipartite graph in which one part has 4 vertices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206414)
