Optimal L(h,k)-labeling of regular grids
From MaRDI portal
Publication:5387672
Recommendations
Cited in
(25)- On irreducible no-hole \(L(2, 1)\)-labelings of hypercubes and triangular lattices
- \(L(p,q)\)-labeling and integer tension of a graph embedded on torus
- Graph labellings with variable weights, a survey
- On a dispersion problem in grid labeling
- Structural Information and Communication Complexity
- L(1, 2)-edge-labelings for lattices
- Labeling the \(r\)-path with a condition at distance two
- Distance two labeling on the square of a cycle
- \(L(h, k)\)-labelling for octagonal grid
- L(3,2,1)-labeling of triangular and toroidal grids
- No-hole \(\lambda-L(k,k-1,\dots,2,1)\)-labeling for square grid
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
- On \(L'(2, 1)\)-edge coloring number of regular grids
- Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids
- Anti-\(k\)-labeling of graphs
- L(2,1)-labeling of interval graphs
- On the span of \(\ell\) distance coloring of infinite hexagonal grid
- Multiple \(L(j,1)\)-labeling of the triangular lattice
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
- Well-spaced labelings of points in rectangular grids
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
- \(L(p,q)\) labeling of \(d\)-dimensional grids
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures
- \(L(d,1)\)-labeling of regular tilings
- \(L(j, k)\)-number of direct product of path and cycle
This page was built for publication: Optimal \(L(h,k)\)-labeling of regular grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387672)
