Vertex strongly distinguishing total coloring of the complete bipartite graph K₆,8

DOI10.13413/J.CNKI.JDXBLXB.2016.05.17MaRDI QIDQ2984346zbMATH OpenFDO

Authors Beibei Wang, Lijuan Qi, Xinsheng Liu, Xiang'en Chen

Publication date 17 May 2017

Full work available at URL https://doi.org/10.13413/J.CNKI.JDXBLXB.2016.05.17

zbMATH Keywords

complete bipartite graphvertex strongly distinguishing total chromatic numbervertex strongly distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Vertex-distinguishing E-total coloring of complete bipartite graph ${K_{6,n}}$ with ${6 \le n \le 38}$
• The vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{8, n}}\) \((n \ge 7770)\)
• scientific article; zbMATH DE number 7448540
• Probe of schemes for a vertex strongly distinguishing total coloring of the complete bipartite graph \(K_{5,7}\)
• Vertex strongly distinguishing total colorings of complete bipartite graphs \(K_{1,n},\;K_{2,n}\) and \(K_{3,n}\)

Cited in

(2)

• Vertex strongly distinguishing total colorings of complete bipartite graphs \(K_{1,n},\;K_{2,n}\) and \(K_{3,n}\)
• Probe of schemes for a vertex strongly distinguishing total coloring of the complete bipartite graph \(K_{5,7}\)

This page was built for publication: Vertex strongly distinguishing total coloring of the complete bipartite graph \(K_{6,8}\)

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