Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs

DOI10.1007/s00373-015-1646-yzbMath1342.05052OpenAlexW2108756413MaRDI QIDQ2631097

Xiaowei Yu, Changqing Xu, Jingjing Yao, Guang-Hui Wang

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

zbMATH Keywords

combinatorial Nullstellensatzadjacent vertex distinguishing total coloring\(d\)-degenerate graphList total coloringneighbor sum (set)~~distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ Neighbor sum distinguishing total chromatic number of 2-degenerate graphs ⋮ Neighbor sum distinguishing total coloring of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph ⋮ Neighbor sum distinguishing total coloring of 2-degenerate graphs ⋮ Neighbor sum distinguishing total coloring of planar graphs without 4-cycles ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of cubic graphs ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles ⋮ Neighbor sum distinguishing total coloring of graphs with bounded treewidth ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs

Cites Work

• Unnamed Item
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Combinatorial Nullstellensatz

This page was built for publication: Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs