On the irregularity strength of them ×n grid
From MaRDI portal
Publication:4014275
DOI10.1002/jgt.3190160409zbMath0771.05055MaRDI 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
Unnamed Item, On 3-total edge product cordial labeling of grid, On reflexive edge strength of generalized prism graphs, On the edge irregular reflexive labeling of corona product of graphs with path, Distant sum distinguishing index of graphs with bounded minimum degree, Irregularity strength of dense graphs, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, Total irregularity strength of some cubic graphs, 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, Total edge irregularity strength of generalized prism, On irregular total labellings, Total edge irregularity strength of complete graphs and complete bipartite graphs, Irregularity strength of the toroidal grid, Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs, On edge irregular reflexive labellings for the generalized friendship graphs, Distant total irregularity strength of graphs via random vertex ordering, The irregularity strength of \(tK_ p\), Distant sum distinguishing index of graphs, Note on edge irregular reflexive labelings of graphs, Edge irregular reflexive labeling for disjoint union of generalized Petersen graph, Total edge irregularity strength of accordion graphs, Distant irregularity strength of graphs with bounded minimum degree, On edge irregular total labeling of categorical product of two cycles, Edge irregular reflexive labeling for the \(r\)-th power of the path, Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
Cites Work
