Optimal L(_1,_2,1)-labeling of eight-regular grids

DOI10.1016/J.IPL.2013.03.003MaRDI QIDQ396591zbMATH OpenOpenAlexFDO

Authors Tiziana Calamoneri

Publication date 13 August 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.03.003

zbMATH Keywords

channel assignment probleminterconnection networkscombinatorial problemstriangular grids\(L(2,1,1)\)-labeling\(L(3,2,1)\)-labelingeight-regular grids (ERGs)

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Optimal \(L(h,k)\)-labeling of regular grids
• Optimal \(L(j,k)\)-edge-labeling of regular grids
• \(L(h, k)\)-labelling for octagonal grid
• \(L(p,q)\) labeling of \(d\)-dimensional grids
• An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids
• On \(L'(2, 1)\)-edge coloring number of regular grids
• L(3,2,1)-labeling of triangular and toroidal grids
• No-hole \(\lambda-L(k,k-1,\dots,2,1)\)-labeling for square grid

Cites work

• scientific article; zbMATH DE number 1953162 (Why is no real title available?)
• Distance three labelings of trees
• Models and solution techniques for frequency assignment problems
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• \(L(3,2,1)\)-labeling of graphs

Cited in

(14)

• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• On a dispersion problem in grid labeling
• Optimal \(L(h,k)\)-labeling of regular grids
• \(L(p,q)\) labeling of \(d\)-dimensional grids
• \(L(3, 2, 1)\)-labeling of certain planar graphs
• \(L(3,2,1)\)-labeling for cylindrical grid: the Cartesian product of a path and a cycle
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice
• On \(L'(2, 1)\)-edge coloring number of regular grids
• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
• On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span
• The minimum span of \(L(2,1)\)-labelings of generalized flowers
• \(L(h, k)\)-labelling for octagonal grid

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396591)