On (s,t)-relaxed L(2,1)-labelings of the square lattice
From MaRDI portal
Publication:2445232
DOI10.1016/J.IPL.2013.06.012zbMATH Open1285.05158OpenAlexW203538168MaRDI QIDQ2445232FDOQ2445232
Authors: Benqiu Dai, Wensong Lin 
Publication date: 14 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.012
Recommendations
combinatorial problemschannel assignment\(L(2,1)\)-labelingsquare lattice\((s,t)\)-relaxed \(L(2,1)\)-labeling
Cites Work
- Labelling Graphs with a Condition at Distance 2
- A survey on labeling graphs with a condition at distance two
- \(L(h,1)\)-labeling subclasses of planar graphs
- Graph labeling and radio channel assignment
- Optimal \(L(h,k)\)-labeling of regular grids
- On circular-\(L\)(2,1)-edge-labeling of graphs
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- Real Number Channel Assignments for Lattices
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- Distance two edge labelings of lattices
Cited In (6)
- On (s,t)-relaxed L(1,1)-labelling of trees
- On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
- Facial \(L(2, 1)\)-edge-labelings of trees
- Frequency assignment problem in networks with limited spectrum
- A note on \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
This page was built for publication: On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445232)
