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

DOI10.3785/J.ISSN.1008-9497.2020.01.008zbMath1463.05152OpenAlexW3214185804MaRDI QIDQ5128139

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

Publication date: 27 October 2020

Full work available at URL: http://www.zjujournals.com/sci/CN/10.3785/j.issn.1008-9497.2020.01.008

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: 完全二部图 K 10, n (215 ≤ n ≤ 466)的点可区别E-全染色