Optimal L(h,k)-labeling of regular grids

zbMATH Open1153.05061MaRDI QIDQ5387672FDOQ5387672

Authors: Tiziana Calamoneri 

Publication date: 27 May 2008

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/82/showToc.html

Recommendations

• \(L(h, k)\)-labelling for octagonal grid
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids
• Optimal \(L(j,k)\)-edge-labeling of regular grids
• Labeling trees with a condition at distance two

zbMATH Keywords

colouringhexagonal gridssquared gridscellular gridsL(h,k)-labelling problem

Mathematics Subject Classification ID

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

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
• On a dispersion problem in grid labeling
• Graph labellings with variable weights, a survey
• Structural Information and Communication Complexity
• \(L(1, 2)\)-edge-labelings for lattices
• Distance two labeling on the square of a cycle
• Labeling the \(r\)-path with a condition at distance two
• \(L(h, k)\)-labelling for octagonal grid
• No-hole \(\lambda-L(k,k-1,\dots,2,1)\)-labeling for square grid
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• On \(L'(2, 1)\)-edge coloring number of regular grids
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-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
• \(L(d,1)\)-labeling of regular tilings
• 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(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)