Optimal L(h,k)-labeling of regular grids
From MaRDI portal
Recommendations
Cited in
(25)- Multiple L(j,1)-labeling of the triangular lattice
- Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures
- Anti-\(k\)-labeling of graphs
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
- L(p,q) labeling of d-dimensional grids
- \(L(j, k)\)-number of direct product of path and cycle
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
- L(1, 2)-edge-labelings for lattices
- Well-spaced labelings of points in rectangular grids
- On irreducible no-hole L(2, 1)-labelings of hypercubes and triangular lattices
- \(L(h, k)\)-labelling for octagonal grid
- On a dispersion problem in grid labeling
- L(3,2,1)-labeling of triangular and toroidal grids
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
- No-hole -L(k,k-1,,2,1)-labeling for square grid
- L(2,1)-labeling of interval graphs
- On L'(2, 1)-edge coloring number of regular grids
- Distance two labeling on the square of a cycle
- Structural Information and Communication Complexity
- \(L(d,1)\)-labeling of regular tilings
- L(p,q)-labeling and integer tension of a graph embedded on torus
- On the span of distance coloring of infinite hexagonal grid
- Graph labellings with variable weights, a survey
- Labeling the \(r\)-path with a condition at distance two
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)
