Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz

DOI10.1007/s00373-017-1806-3zbMath1371.05078OpenAlexW2616957134MaRDI QIDQ2409525

Jiguo Yu, Guang-Hui Wang, Lai-hao Ding, Jian Liang Wu

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1806-3

zbMATH Keywords

coloring numberneighbor sum distinguishing total coloringcombinatorial Nullstellensatzlist total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Neighbor sum distinguishing total choosability of planar graphs without 4-cycles, Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic, Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz, Neighbor sum distinguishing total chromatic number of 2-degenerate graphs, A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles, Neighbor sum distinguishing total choosability of planar graphs, Choosability with union separation of planar graphs without cycles of length 4, Neighbor sum distinguishing total coloring of planar graphs without 5-cycles, Neighbor sum distinguishing total coloring of 2-degenerate graphs, Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles, Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions, Neighbor sum distinguishing total coloring of planar graphs without 4-cycles, Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs, On the neighbor sum distinguishing total coloring of planar graphs, Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10, Neighbor sum distinguishing total coloring of sparse IC-planar graphs, Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24, Neighbor sum distinguishing total choosability of cubic graphs, Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10, Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles, Neighbor sum distinguishing total choosability of IC-planar graphs, Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13, Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten, Neighbor sum distinguishing total colorings of corona of subcubic graphs, Neighbor sum distinguishing total colorings of triangle free planar graphs, On \((3, r)\)-choosability of some planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted-1-antimagic graphs of prime power order
• 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\)
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Irregularity strength of regular graphs
• Edge weights and vertex colours
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• 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
• Antimagic labelling of vertex weighted graphs
• Bounding the weight choosability number of a graph
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Total weight choosability of graphs
• Total weight choosability of graphs