On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
From MaRDI portal
Publication:2445232
DOI10.1016/j.ipl.2013.06.012zbMath1285.05158OpenAlexW203538168MaRDI QIDQ2445232
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
combinatorial problemschannel assignmentsquare lattice\((s,t)\)-relaxed \(L(2,1)\)-labeling\(L(2,1)\)-labeling
Related Items
Facial \(L(2, 1)\)-edge-labelings of trees, A note on \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs, Frequency assignment problem in networks with limited spectrum, On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs, On (s,t)-relaxed L(1,1)-labelling of trees, On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
Cites Work
- Unnamed Item
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- On circular-\(L\)(2,1)-edge-labeling of graphs
- Distance two edge labelings of lattices
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- A survey on labeling graphs with a condition at distance two
- Real Number Channel Assignments for Lattices
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment