完全二部图K10,n(10≤n≤90)的点可区别E-全染色

DOI10.6040/J.ISSN.1671-9352.0.2018.605zbMath1438.05095OpenAlexW2910941648MaRDI QIDQ5196778

Zhi-wen Wang, Liya Bao, Xiang'en Chen

Publication date: 20 September 2019

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

zbMATH Keywords

complete bipartite graphsE-total coloringvertex-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: 完全二部图K10,n(10≤n≤90)的点可区别E-全染色