Finding irregular subgraphs via local adjustments
From MaRDI portal
Cites work
- A new upper bound for the irregularity strength of graphs
- A Tight Bound on the Irregularity Strength of Graphs
- An iterative approach to graph irregularity strength
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- scientific article; zbMATH DE number 4139798 (Why is no real title available?)
- scientific article; zbMATH DE number 4142086 (Why is no real title available?)
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- scientific article; zbMATH DE number 867641 (Why is no real title available?)
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Irregularity strength of dense graphs
- Irregularity strength of regular graphs
- Irregularity strength of regular graphs of large degree
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- On graph irregularity strength
- On random irregular subgraphs
- On the asymptotic confirmation of the Faudree-Lehel conjecture for general graphs
- On the irregularity strength of dense graphs
- On the irregularity strength of them ×n grid
- On the irregularity strength of trees
- Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
This page was built for publication: Finding irregular subgraphs via local adjustments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951206)