完全二部图K9, n (93 ≤ n ≤ 216)的点可区别E-全染色

DOI10.3969/J.ISSN.1000-5641.201911028zbMath1474.05128OpenAlexW3115493509MaRDI QIDQ4984221

Xiang'en Chen, Weiguang Yang

Publication date: 26 April 2021

Full work available at URL: http://hdsfdxzkb.xml-journal.net/cn/article/doi/10.3969/j.issn.1000-5641.201911028

zbMATH Keywords

complete bipartite graphE-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: 完全二部图K9, n (93 ≤ n ≤ 216)的点可区别E-全染色