Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
From MaRDI portal
Publication:2631097
DOI10.1007/s00373-015-1646-yzbMath1342.05052MaRDI QIDQ2631097
Changqing Xu, Guang-Hui Wang, Xiaowei Yu, Jingjing Yao
Publication date: 28 July 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1646-y
combinatorial Nullstellensatz; adjacent vertex distinguishing total coloring; \(d\)-degenerate graph; List total coloring; neighbor sum (set)~~distinguishing total coloring
05C15: Coloring of graphs and hypergraphs