On (s,t)-relaxed L(2,1)-labelings of the square lattice
From MaRDI portal
(Redirected from Publication:2445232)
On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
Recommendations
Cites work
- A survey on labeling graphs with a condition at distance two
- Distance two edge labelings of lattices
- Graph labeling and radio channel assignment
- Labelling Graphs with a Condition at Distance 2
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- On circular-L(2,1)-edge-labeling of graphs
- Optimal \(L(h,k)\)-labeling of regular grids
- Real Number Channel Assignments for Lattices
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- \(L(h,1)\)-labeling subclasses of planar graphs
Cited in
(7)- On (s,t)-relaxed L(2,1)-labelings of the hexagonal lattice.
- On (s,t)-relaxed L(2,1)-labeling of graphs
- On \((s,t)\)-relaxed \(L(1,1)\)-labelling of trees
- 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)
