Asymptotically optimal neighbour sum distinguishing colourings of graphs
From MaRDI portal
Publication:3460519
DOI10.1002/rsa.20553zbMath1331.05083arXiv1508.01062OpenAlexW2015624673MaRDI QIDQ3460519
Publication date: 7 January 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.01062
Related Items
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11, Asymptotically optimal neighbor sum distinguishing total colorings of graphs, Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs, Neighbor-sum-distinguishing edge choosability of subcubic graphs, Neighbor sum distinguishing index of 2-degenerate graphs, List neighbor sum distinguishing edge coloring of subcubic graphs, Distant set distinguishing edge colourings of graphs, Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees, Neighbor sum distinguishing index of sparse graphs, On the neighbour sum distinguishing index of graphs with bounded maximum average degree, Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz, A note on asymptotically optimal neighbour sum distinguishing colourings, Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9, Adjacent vertex distinguishing colorings by sum of sparse graphs, Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\), Neighbor sum distinguishing edge coloring of subcubic graphs, Distant sum distinguishing index of graphs, Neighbor sum distinguishing index of subcubic graphs, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, Distant sum distinguishing index of graphs with bounded minimum degree, On the Neighbor Sum Distinguishing Index of Planar Graphs, Neighbor sum distinguishing edge colorings of sparse graphs
Cites Work
- Unnamed Item
- Neighbor sum distinguishing index
- \(r\)-strong edge colorings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Adjacent strong edge coloring of graphs
- Edge weights and vertex colours
- \(\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
- Irregular Assignments of Trees and Forests
- Combinatorial Nullstellensatz
- A Tight Bound on the Irregularity Strength of Graphs
- On graph irregularity strength
- On the Irregularity Strength of Dense Graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- Graph colouring and the probabilistic method
