Irregularity strength of regular graphs
From MaRDI portal
Recommendations
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Publication:3474681
- 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
(47)- Maximum locally irregular induced subgraphs via minimum irregulators
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
- Distant irregularity strength of graphs
- Neighbor sum distinguishing index of planar graphs
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- A new upper bound for the total vertex irregularity strength of graphs
- Irregularity strength of regular graphs of large degree
- Irregularity strength of digraphs
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Irregular subgraphs
- Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- Irregularity strength of corona of two graphs
- Minimum-weight edge discriminators in hypergraphs
- Distant sum distinguishing index of graphs with bounded minimum degree
- Sum-distinguishing number of sparse hypergraphs
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
- Modular irregularity strength of graphs
- Distant sum distinguishing index of graphs
- Distant irregularity strength of graphs with bounded minimum degree
- Modular irregularity strength of dense graphs
- On vertex and edge \(H\)-irregularity strengths of graphs
- Colourings of graphs by labellings
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- Distant total irregularity strength of graphs via random vertex ordering
- scientific article; zbMATH DE number 4142086 (Why is no real title available?)
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
- Distant total sum distinguishing index of graphs
- Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs
- On the neighbor sum distinguishing total coloring of planar graphs
- On weight choosabilities of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- An iterative approach to graph irregularity strength
- On the asymptotic confirmation of the Faudree-Lehel conjecture for general graphs
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- Modular irregularity strength of the corona product of graphs
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs
- Neighbor sum distinguishing total colorings of planar graphs
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- On edge \(H\)-irregularity strengths of some graphs
- Irregular labelings of circulant graphs
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)
