Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
From MaRDI portal
Publication:6081547
DOI10.1002/jgt.22772zbMath1522.05406arXiv1912.07858OpenAlexW3215913703WikidataQ113915839 ScholiaQ113915839MaRDI QIDQ6081547
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.07858
Related Items (3)
Irregular subgraphs ⋮ Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture ⋮ Sum-distinguishing number of sparse hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On decomposing graphs of large minimum degree into locally irregular subgraphs
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Decomposing graphs into a constant number of locally irregular subgraphs
- Neighbor sum distinguishing index
- Every graph is \((2,3)\)-choosable
- Irregularity strength of regular graphs of large degree
- An iterative approach to graph irregularity strength
- On irregular total labellings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Irregularity strength of regular graphs
- A new upper bound for the total vertex irregularity strength of graphs
- On the number of irregular assignments on a graph
- Irregularity strength of trees
- Multi-set neighbor distinguishing 3-edge coloring
- A note on asymptotically optimal neighbour sum distinguishing colourings
- 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
- The irregularity strength and cost of the union of cliques
- Irregularity strength and compound graphs
- The 1-2-3 conjecture almost holds for regular graphs
- On decomposing regular graphs into locally irregular subgraphs
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Vertex colouring edge partitions
- 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
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- On graph irregularity strength
- 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
- Total Vertex Irregularity Strength of Dense Graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- Irregularity strength of dense graphs
This page was built for publication: Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
