Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
DOI10.1007/S10255-016-0583-8zbMATH Open1336.05046OpenAlexW2344826748MaRDI QIDQ287913FDOQ287913
Authors: Cun-quan Qu, Lai-hao Ding, Guanghui Wang, Guiying 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
Recommendations
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Neighbor sum distinguishing total choosability of planar graphs
- Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Neighbor sum distinguishing index of a kind of sparse graphs
combinatorial nullstellensatzneighbor sum distinguishing total coloringneighbor sum distinguishing total choice number
Cites Work
- Edge weights and vertex colours
- On adjacent-vertex-distinguishing total coloring of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Graph theory with applications
- On a \(1,2\) conjecture
- Title not available (Why is that?)
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Irregularity strength of regular graphs
- 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
- Antimagic labelling of vertex weighted graphs
- Combinatorial Nullstellensatz
- Weighted-1-antimagic graphs of prime power order
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Total weight choosability of graphs
- Total weight choosability of graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Adjacent vertex distinguishing total colorings of outerplanar graphs
Cited In (5)
- Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
- Neighbor sum distinguishing total choosability of cubic graphs
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
- Neighbor sum distinguishing total coloring of a kind of sparse graph.
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
This page was built for publication: Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287913)
