Irregular Assignments of Trees and Forests
From MaRDI portal
Recommendations
Cited in
(79)- Edge irregular total labellings for graphs of linear size
- 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
- Binary labeling of graphs
- Vertex-distinguishing edge-colorings of 2-regular graphs
- A note on the weak \((2,2)\)-conjecture
- Note on group irregularity strength of disconnected 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
- Irregular labelings of circulant graphs
- A smallest irregular oriented graph containing a given diregular one
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
- Note on the group edge irregularity strength of graphs
- Distant sum distinguishing index of graphs
- On edge H-irregularity strengths of some graphs
- Upper bounds on inclusive distance vertex irregularity strength
- On the edge irregularity strength for some classes of plane 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
- On decomposing regular graphs into locally irregular subgraphs
- Group irregularity strength of connected graphs
- On H-irregularity strength of graphs
- Distant irregularity strength of graphs with bounded minimum degree
- Edge coloring total \(k\)-labeling of generalized Petersen graphs
- New estimates for the gap chromatic number
- Distant set distinguishing total colourings of graphs
- On the reflexive edge strength of the circulant graphs
- On edge irregularity strength of graphs
- A survey of irregularity strength
- Computing an irregularity strength of selected graphs
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Distant irregularity strength of graphs
- scientific article; zbMATH DE number 15351 (Why is no real title available?)
- scientific article; zbMATH DE number 139927 (Why is no real title available?)
- Application of polynomial method to on-line list colouring of graphs
- On the irregularity strength of trees
- scientific article; zbMATH DE number 1506504 (Why is no real title available?)
- On graph irregularity strength
- scientific article; zbMATH DE number 867641 (Why is no real title available?)
- scientific article; zbMATH DE number 1416477 (Why is no real title available?)
- Modular irregularity strength of graphs
- On the neighbor sum distinguishing index of planar graphs
- On \(H\)-irregularity strengths of \(\mathcal{G}\)-amalgamation of graphs
- Computing the edge irregularity strengths of chain graphs and the join of two graphs
- On the edge irregularity strength of corona product of cycle with isolated vertices
- Distance irregularity strength of graphs with pendant vertices
- Vertex irregular reflexive labeling of prisms and wheels
- On the edge irregularity strength of grid graphs
- Distant sum distinguishing index of graphs with bounded minimum degree
- On vertex and edge \(H\)-irregularity strengths of graphs
- Total vertex irregularity strength of dense graphs
- Irregular assignments of the union of several vertex-disjoint paths with order \(n\)
- Highly irregular
- On the edge irregularity strength of corona product of graphs with cycle
- 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
- Modular irregularity strength on some flower graphs
- 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
- Modular irregularity strength of dense graphs
- Modular irregularity strength of the corona product of graphs
- Combinatorial spectra using polynomials.
- The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
- The 1-2-3 conjecture holds for graphs with large enough minimum degree
- The total edge irregularity strength of hexagonal grid graphs
- Group irregularity strength of disconnected graphs
- Total vertex product irregularity strength of graphs
- Zero-sum partitions of abelian groups and their applications to magic- and antimagic-type labelings
- On asymptotic confirmation of the Faudree-Lehel conjecture on the irregularity strength of graphs (extended abstract)
- An iterative approach to graph irregularity strength
- 2-distance vertex-distinguishing index of subcubic graphs
- Edge colouring by total labellings
This page was built for publication: Irregular Assignments of Trees and Forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970584)
