完全二部图K_(2,n)和K_(3,n)的一般点可区别全染色

DOI10.13413/J.CNKI.JDXBLXB.2016.06.18zbMATH Open1374.05086OpenAlexW2906687352MaRDI QIDQ5276976

Zhiwen Wang, Xiang'en Chen, Li Su

Publication date: 14 July 2017

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

zbMATH Keywords

complete bipartite graphsgeneral vertex-distinguishing total chromatic numbergeneral vertex-distinguishing total coloringgeneral total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ General vertex-distinguishing total coloring of complete bipartite graphs. ⋮ Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\)) ⋮ 完全二部图K3,n（3≤n≤17）的点可区别E-全染色

This page was built for publication: 完全二部图K_(2,n)和K_(3,n)的一般点可区别全染色

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276976)