完全二部图K3,n（3≤n≤17）的点可区别E-全染色

DOI10.13413/J.CNKI.JDXBLXB.2015.06.17zbMath1349.05113OpenAlexW2290357109MaRDI QIDQ2992842

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

Publication date: 10 August 2016

Full work available at URL: http://or.nsfc.gov.cn/bitstream/00001903-5/434099/1/1000013950880.pdf

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（3≤n≤17）的点可区别E-全染色