On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
From MaRDI portal
Publication:2343988
DOI10.1007/s10878-013-9615-yzbMath1336.90097OpenAlexW2318096031MaRDI QIDQ2343988
Publication date: 11 May 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9615-y
Related Items (4)
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(1,1)-labelling of trees
Cites Work
- Unnamed Item
- 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
- Multiple \(L(j,1)\)-labeling of the triangular lattice
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
- 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
This page was built for publication: On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice