Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Signed and weighted graphs (05C22)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
Distant irregularity strength of graphs
Every graph is \((2,3)\)-choosable
Irregularity strength of regular graphs of large degree
An iterative approach to graph irregularity strength
Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
On vertex-coloring 13-edge-weighting
Irregularity strength of regular graphs
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs
The irregularity strength of \(K_{m,m}\) is 4 for odd m
Irregular networks, regular graphs and integer matrices with distinct row and column sums
Edge weights and vertex colours
Total weight choosability of graphs: towards the 1-2-3-conjecture
Every nice graph is (1,5)-choosable
The 1-2-3 conjecture almost holds for regular graphs
Distant irregularity strength of graphs with bounded minimum degree
Vertex-colouring edge-weightings
Degree constrained subgraphs
How to Define an Irregular Graph
A New Upper Bound for the Irregularity Strength of Graphs
Weight choosability of graphs
Irregular Assignments of Trees and Forests
On the irregularity strength of them ×n grid
On the irregularity strength of trees
A Tight Bound on the Irregularity Strength of Graphs
The 1‐2‐3‐conjecture holds for dense graphs
On graph irregularity strength
On the Irregularity Strength of Dense Graphs
Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
Irregularity strength of dense graphs
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
Vertex-coloring graphs with 4-edge-weightings
On the asymptotic confirmation of the Faudree-Lehel conjecture for general graphs
Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture
A solution to the 1-2-3 conjecture