Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
From MaRDI portal
Publication:287913
DOI10.1007/s10255-016-0583-8zbMath1336.05046OpenAlexW2344826748MaRDI QIDQ287913
Lai-hao Ding, Cun-quan Qu, Guang-Hui Wang, Gui Ying Yan
Publication date: 23 May 2016
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-016-0583-8
combinatorial nullstellensatzneighbor sum distinguishing total coloringneighbor sum distinguishing total choice number
Related Items (3)
Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of cubic graphs ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
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
- 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 (set) distinguishing total choosability via the combinatorial Nullstellensatz
- 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
- 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
This page was built for publication: Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
