Vertex-distinguishing E-total coloring of complete bipartite graph K₇,n when 473 n<977.

MaRDI QIDQ5033138zbMATH OpenFDO

Authors Xiang'en Chen

Publication date 22 February 2022

zbMATH Keywords

complete bipartite graphE-total coloringvertex-distinguishing E-total chromatic numbervertex-distinguishing E-total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• 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_{3,n}\) with \(n\geq 18\)
• Vertex-distinguishing E-total coloring of complete bipartite graph \({K_{8,n}}\) with \({472 \le n \le 980}\)
• 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 in which one part has 4 vertices.

Cited in

(6)

• 完全二部图K3,n（3≤n≤17）的点可区别E-全染色
• 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?)
• 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 in which one part has 4 vertices.
• Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(7 \leq n \leq 95\)

This page was built for publication: Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(473\leq n<977\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033138)