On the Irregularity Strength of Dense Graphs

DOI10.1137/120886650zbMath1293.05341OpenAlexW2048759904MaRDI QIDQ4979835

Piotr Majerski, Jakub Przybyło

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120886650

zbMATH Keywords

irregular assignmentirregularity strengthhypergeometric distributionvertex orderingirregular weighting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (43)

Irregular subgraphs ⋮ On edge irregularity strength of graphs ⋮ On total edge irregularity strength for some special types of uniform theta snake graphs ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Product irregularity strength of graphs with small clique cover number ⋮ Note on group irregularity strength of disconnected graphs ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ A survey of irregularity strength ⋮ Distance irregularity strength of graphs with pendant vertices ⋮ On H-irregularity strength of graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ 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 ⋮ On edge irregularity strength of different families of graphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Sum-distinguishing number of sparse hypergraphs ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ Distant total sum distinguishing index of graphs ⋮ Unnamed Item ⋮ On irregularity strength of diamond network ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ On entire face irregularity strength of disjoint union of plane graphs ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ Vertex irregular reflexive labeling of prisms and wheels ⋮ On -irregularity strength of ladders and fan graphs ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ 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 ⋮ 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 ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ On H-irregularity strengths of G-amalgamation of graphs ⋮ On decomposing regular graphs into locally irregular subgraphs ⋮ Group irregularity strength of connected graphs ⋮ On face irregular evaluations of plane graphs

This page was built for publication: On the Irregularity Strength of Dense Graphs