The vertex-distinguishing E-total coloring of a complete bipartite graph K₈, n (n 7770)
From MaRDI portal
Publication:3380743
Recommendations
- scientific article; zbMATH DE number 7448540
- 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_{6,n}}$ with ${6 \le n \le 38}$
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(96\leq n\leq 472\).
- scientific article; zbMATH DE number 7266867
Cited in
(6)- Vertex strongly distinguishing total coloring of the complete bipartite graph \(K_{6,8}\)
- Vertex-distinguishing total coloring of ladder graphs (\(n\equiv 2\pmod{8}\))
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(96\leq n\leq 472\).
- scientific article; zbMATH DE number 7448540 (Why is no real title available?)
- 完全二部图 K 10, n (215 ≤ n ≤ 466)的点可区别E-全染色
- Vertex-distinguishing E-total coloring of complete bipartite graph ${K_{6,n}}$ with ${6 \le n \le 38}$
This page was built for publication: The vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{8, n}}\) \((n \ge 7770)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3380743)
