scientific article; zbMATH DE number 867641
From MaRDI portal
Publication:4873753
Recommendations
Cited in
(52)- On the number of irregular assignments on a graph
- On the vertex-distinguishing proper edge-colorings of graphs
- Codings of graphs with binary edge labels
- Irregular weighting of 1-designs
- Irregularity strength of the toroidal grid
- Vertex-distinguishing edge-colorings of 2-regular graphs
- The irregularity cost of a graph
- Irregularity strength of trees
- Note on group irregularity strength of disconnected graphs
- On edge irregular reflexive labellings for the generalized friendship graphs
- Distant set distinguishing edge colourings of graphs
- Colourings of graphs by labellings
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- Distant total irregularity strength of graphs via random vertex ordering
- Distant total sum distinguishing index of graphs
- A note on asymptotically optimal neighbour sum distinguishing colourings
- The irregular coloring number of a tree
- Irregular embeddings of hypergraphs with fixed chromatic number
- The irregularity strength of \(tK_ p\)
- The irregularity strength and cost of the union of cliques
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
- Distant sum distinguishing index of graphs
- The 1-2-3 conjecture almost holds for regular graphs
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
- Note on edge irregular reflexive labelings of graphs
- On decomposing regular graphs into locally irregular subgraphs
- Distant irregularity strength of graphs with bounded minimum degree
- The irregularity strength of circulant graphs
- On the irregularity strength of them ×n grid
- Minimum-weight edge discriminators in hypergraphs
- On graph irregularity strength
- scientific article; zbMATH DE number 811600 (Why is no real title available?)
- On reflexive edge strength of generalized prism graphs
- On the edge irregular reflexive labeling of corona product of graphs with path
- On weight choosabilities of graphs with bounded maximum average degree
- Distant sum distinguishing index of graphs with bounded minimum degree
- Highly irregular
- Irregular subgraphs
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- A generalization of Faudree–Lehel conjecture holds almost surely for random 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
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
- Finding irregular subgraphs via local adjustments
- The 1-2-3 conjecture holds for graphs with large enough minimum degree
- The total edge irregularity strength of hexagonal grid graphs
- Total vertex product irregularity strength of graphs
- Face irregular evaluations of family of grids
- On asymptotic confirmation of the Faudree-Lehel conjecture on the irregularity strength of graphs (extended abstract)
- An iterative approach to graph irregularity strength
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4873753)
