Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
From MaRDI portal
Publication:477256
DOI10.1007/S11425-014-4796-0zbMATH Open1303.05058OpenAlexW2256620441MaRDI QIDQ477256FDOQ477256
Guanghui Wang, Lai-hao Ding, Guiying Yan
Publication date: 3 December 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-014-4796-0
Recommendations
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
- A note on the neighbor sum distinguishing total coloring of planar graphs
combinatorial nullstellensatzneighbor sum distinguishing total coloringlist total coloringcoloring number
Cites Work
- Edge weights and vertex colours
- On adjacent-vertex-distinguishing total coloring of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Title not available (Why is that?)
- 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 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
- 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
- The number of edge 3-colorings of a planar cubic graph as a permanent
Cited In (44)
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- 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 sum distinguishing list total coloring of subcubic graphs
- Combinatorial Nullstellensatz
- Neighbor sum distinguishing total colorings of planar graphs
- Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
- Neighbor sum distinguishing total choosability of planar graphs
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth
- On the neighbor sum distinguishing total coloring of planar graphs
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Neighbor sum distinguishing total coloring of 2-degenerate graphs
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- 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 choosability of planar graphs without adjacent triangles
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
- Neighbor sum distinguishing total coloring of planar graphs with restrained cycles
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- A note on the neighbor sum distinguishing total coloring of planar graphs
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
- Neighbor sum distinguishing total coloring of IC-planar graphs
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
- Neighbor sum distinguishing total chromatic number of planar graphs
This page was built for publication: Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477256)
