On the irregularity strength of them ×n grid
From MaRDI portal
Publication:4014275
DOI10.1002/jgt.3190160409zbMath0771.05055OpenAlexW2144780648MaRDI QIDQ4014275
David K. Garnick, Jeffrey H. Dinitz, András Gyárfás
Publication date: 5 October 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160409
Related Items (26)
Total edge irregularity strength of generalized prism ⋮ Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs ⋮ On reflexive edge strength of generalized prism graphs ⋮ Irregularity strength of the toroidal grid ⋮ The irregularity strength of \(tK_ p\) ⋮ On edge irregular reflexive labellings for the generalized friendship graphs ⋮ On irregular total labellings ⋮ Total edge irregularity strength of accordion graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ Edge irregular reflexive labeling for the \(r\)-th power of the path ⋮ 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 ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ On edge irregular total labeling of categorical product of two cycles ⋮ On the edge irregular reflexive labeling of corona product of graphs with path ⋮ Total edge irregularity strength of complete graphs and complete bipartite graphs ⋮ Irregularity strength of dense graphs ⋮ Distant sum distinguishing index of graphs ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Note on edge irregular reflexive labelings of graphs ⋮ Unnamed Item ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ On 3-total edge product cordial labeling of grid ⋮ Edge irregular reflexive labeling for disjoint union of generalized Petersen graph ⋮ Total irregularity strength of some cubic graphs ⋮ Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
Cites Work
This page was built for publication: On the irregularity strength of them ×n grid