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

DOI10.1016/J.IPL.2013.03.003zbMATH Open1358.05243OpenAlexW49701365MaRDI QIDQ396591FDOQ396591

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

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

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)

Cites Work

• \(L(3,2,1)\)-labeling of graphs
• Models and solution techniques for frequency assignment problems
• Distance three labelings of trees
• Title not available (Why is that?)
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem

Cited In (12)

• On a dispersion problem in grid labeling
• On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice
• $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• 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
• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
• Optimal \(L(h,k)\)-labeling of regular grids
• \(L(3, 2, 1)\)-labeling of certain planar graphs
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• \(L(p,q)\) labeling of \(d\)-dimensional grids

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)