\mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性

DOI10.11845/SXJZ.2014195BzbMath1363.05087OpenAlexW1549456623MaRDI QIDQ3179898

Zeling Shao, Changqing Xu, Jingjing Yao

Publication date: 6 January 2017

Full work available at URL: http://oaj.pku.edu.cn/sxjz/CN/abstract/abstract71329.shtml

zbMATH Keywords

combinatorial Nullstellensatzmaximum average degreeneighbor sum distinguishing total choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph ⋮ Neighbor sum distinguishing total coloring of planar graphs without 4-cycles

This page was built for publication: \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性