scientific article; zbMATH DE number 7448540
From MaRDI portal
Publication:5017147
Recommendations
- The vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{8, n}}\) \((n \ge 7770)\)
- Vertex-distinguishing E-total coloring of complete bipartite graph \({K_{8,n}}\) with \({472 \le n \le 980}\)
- 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 \(96\leq n\leq 472\).
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(7 \leq n \leq 95\)
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(473\leq n<977\).
- 完全二部图K3,n（3≤n≤17）的点可区别E-全染色
- Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{8,n}\)
- Vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{9,n}}\) \((93 \le n \le 216)\)
- scientific article; zbMATH DE number 7234929
Cited in
(8)- scientific article; zbMATH DE number 7234929 (Why is no real title available?)
- Vertex-distinguishing E-total coloring of complete bipartite graph ${K_{6,n}}$ with ${6 \le n \le 38}$
- 完全二部图K3,n（3≤n≤17）的点可区别E-全染色
- Vertex strongly distinguishing total coloring of the complete bipartite graph \(K_{6,8}\)
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(96\leq n\leq 472\).
- scientific article; zbMATH DE number 7266867 (Why is no real title available?)
- The vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{8, n}}\) \((n \ge 7770)\)
- 完全二部图 K 10, n (215 ≤ n ≤ 466)的点可区别E-全染色
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 Q5017147)
