Irregular Assignments of Trees and Forests
From MaRDI portal
Publication:3970584
DOI10.1137/0403038zbMath0735.05049OpenAlexW1980509647MaRDI QIDQ3970584
Eberhard Triesch, Martin Aigner
Publication date: 25 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0403038
Trees (05C05) Extremal problems in graph theory (05C35) Other combinatorial number theory (11B75) Matrices of integers (15B36)
Related Items
On edge irregularity strength of graphs ⋮ A smallest irregular oriented graph containing a given diregular one ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Distant set distinguishing total colourings of graphs ⋮ On vertex and edge H-irregularity strengths of graphs ⋮ On the edge irregularity strength for some classes of plane graphs ⋮ Note on group irregularity strength of disconnected graphs ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ A survey of irregularity strength ⋮ Binary labeling of graphs ⋮ Distance irregularity strength of graphs with pendant vertices ⋮ Vertex-distinguishing edge-colorings of 2-regular graphs ⋮ On H-irregularity strength of graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ On the reflexive edge strength of the circulant graphs ⋮ Distant irregularity strength of graphs ⋮ Distant set distinguishing edge colourings of graphs ⋮ A generalization of Faudree–Lehel conjecture holds almost surely for random graphs ⋮ Colourings of graphs by labellings ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ Modular irregularity strength on some flower graphs ⋮ Application of polynomial method to on-line list colouring of graphs ⋮ Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture ⋮ 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 ⋮ Edge coloring total \(k\)-labeling of generalized Petersen graphs ⋮ New estimates for the gap chromatic number ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ On the edge irregularity strength of corona product of cycle with isolated vertices ⋮ Vertex irregular reflexive labeling of prisms and wheels ⋮ On the edge irregularity strength of grid graphs ⋮ Edge colouring by total labellings ⋮ Total Vertex Irregularity Strength of Dense Graphs ⋮ Irregular labelings of circulant graphs ⋮ 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 ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Modular irregularity strength of graphs ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ On edge \(H\)-irregularity strengths of some graphs ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ Upper bounds on inclusive distance vertex irregularity strength ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Edge irregular total labellings for graphs of linear size ⋮ Highly Irregular ⋮ On H-irregularity strengths of G-amalgamation of graphs ⋮ Computing the edge irregularity strengths of chain graphs and the join of two graphs ⋮ On the vertex-distinguishing proper edge-colorings of graphs ⋮ On the edge irregularity strength of corona product of graphs with cycle ⋮ Computing an irregularity strength of selected graphs ⋮ On decomposing regular graphs into locally irregular subgraphs ⋮ Group irregularity strength of connected graphs ⋮ Codings of graphs with binary edge labels
