Vertex-distinguishing E-total coloring of complete bipartite graph K₃,n with n 18

DOI10.6040/J.ISSN.1671-9352.0.2015.059MaRDI QIDQ2824286zbMATH OpenOpenAlexFDO

Authors Shiling Li, Xiang'en Chen, Zhiwen Wang

Publication date 6 October 2016

Published in Journal of Shandong University. Natural Science (Search for Journal in Brave)

Full work available at URL http://lxbwk.njournal.sdu.edu.cn/CN/10.6040/j.issn.1671-9352.0.2015.059

zbMATH Keywords

complete bipartite graphsvertex-distinguishing E-total chromatic numbervertex-distinguishing E-total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

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

Cited in

(13)

• Vertex strongly distinguishing total colorings of complete bipartite graphs \(K_{1,n},\;K_{2,n}\) and \(K_{3,n}\)
• 完全二部图K3,n（3≤n≤17）的点可区别E-全染色
• Vertex-distinguishing E-total colorings of the graphs mC₃ and mC₄
• scientific article; zbMATH DE number 7234929 (Why is no real title available?)
• Vertex-distinguishing E-total colorings of graphs
• Vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{9,n}}\) \((93 \le n \le 216)\)
• scientific article; zbMATH DE number 7448540 (Why is no real title available?)
• Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(473\leq n<977\).
• scientific article; zbMATH DE number 7266867 (Why is no real title available?)
• 完全二部图 K 10, n (215 ≤ n ≤ 466)的点可区别E-全染色
• Vertex-distinguishing E-total coloring of complete bipartite graph \({K_{10,n}}\) with \({10 \le n \le 90}\)
• 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_{3,n}\) with \(n\geq 18\)

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