Irregularity strength of regular graphs
From MaRDI portal
Recommendations
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- scientific article; zbMATH DE number 4142086
- On graph irregularity strength
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Irregularity strength of regular graphs of large degree
Cited in
(53)- Distant irregularity strength of graphs
- Modular irregularity strength of graphs
- Irregularity strength of corona of two graphs
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 15
- Irregularity strength of regular graphs of large degree
- Minimum-weight edge discriminators in hypergraphs
- The 1-2-3 conjecture holds for graphs with large enough minimum degree
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- Modular irregularity strength of dense graphs
- Distant sum distinguishing index of graphs
- An iterative approach to graph irregularity strength
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Neighbor sum distinguishing index of planar graphs
- Distant sum distinguishing index of graphs with bounded minimum degree
- A new upper bound for the total vertex irregularity strength of graphs
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- On asymptotic confirmation of the Faudree-Lehel conjecture on the irregularity strength of graphs (extended abstract)
- Neighbor sum distinguishing total colorings of planar graphs
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
- Distant total irregularity strength of graphs via random vertex ordering
- Irregular subgraphs
- On the neighbor sum distinguishing total coloring of planar graphs
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Distant irregularity strength of graphs with bounded minimum degree
- On edge H-irregularity strengths of some graphs
- Irregular labelings of circulant graphs
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
- On the asymptotic confirmation of the Faudree-Lehel conjecture for general graphs
- Modular irregularity strength of the corona product of graphs
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- Irregularity strength of digraphs
- Colourings of graphs by labellings
- Parameterised distance to local irregularity
- Sum-distinguishing number of sparse hypergraphs
- The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
- Maximum locally irregular induced subgraphs via minimum irregulators
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs
- Finding irregular subgraphs via local adjustments
- Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture
- On vertex and edge \(H\)-irregularity strengths of graphs
- On weight choosabilities of graphs with bounded maximum average degree
- Distant total sum distinguishing index of graphs
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
- Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs
- scientific article; zbMATH DE number 4142086 (Why is no real title available?)
This page was built for publication: Irregularity strength of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010805)
