Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
From MaRDI portal
Publication:5962524
DOI10.1016/j.dam.2015.08.028zbMath1330.05074OpenAlexW1937159104MaRDI QIDQ5962524
Publication date: 12 February 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.08.028
graph labelling1-2-conjectureadjacent strong chromatic indexcombinatorial nullstellensatzlist total colouringneighbour sum distinguishing indextotal neighbour sum distinguishing number
Related Items
Constructing integer-magic graphs via the Combinatorial Nullstellensatz, A note on the neighbor sum distinguishing total coloring of planar graphs, Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph, Neighbor sum distinguishing total coloring of planar graphs without 4-cycles, Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10, Distant total sum distinguishing index of graphs, A note on asymptotically optimal neighbour sum distinguishing colourings, Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10, On the total neighbour sum distinguishing index of graphs with bounded maximum average degree, Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neighbor sum distinguishing index
- Neighbor sum distinguishing index of planar graphs
- Neighbor sum distinguishing total colorings of planar graphs
- Every graph is \((2,3)\)-choosable
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Irregularity strength of regular graphs
- A bound on the total chromatic number
- Adjacent strong edge coloring of graphs
- Edge weights and vertex colours
- On the total-neighbor-distinguishing index by sums
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
- Weight choosability of graphs
- Irregular Assignments of Trees and Forests
- On the irregularity strength of them ×n grid
- Combinatorial Nullstellensatz
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- On graph irregularity strength
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
- On the Neighbor Sum Distinguishing Index of Planar Graphs
- On the Irregularity Strength of Dense Graphs
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Total weight choosability of graphs
- Total weight choosability of graphs
- Irregularity strength of dense graphs
