完全二部图K3,n(n≥18)的点可区别E-全染色

DOI10.6040/J.ISSN.1671-9352.0.2015.059zbMath1363.05075OpenAlexW2507240653MaRDI QIDQ2824286

Zhi-wen Wang, Xiang'en Chen, Shiling Li

Publication date: 6 October 2016

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)

This page was built for publication: 完全二部图K3,n(n≥18)的点可区别E-全染色