On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
From MaRDI portal
Publication:714037
DOI10.1016/j.dam.2012.06.005zbMath1253.05122OpenAlexW287538350MaRDI QIDQ714037
Publication date: 19 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.06.005
Related Items (5)
On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ Multiple \(L(j,1)\)-labeling of the triangular lattice ⋮ L(h,k)-labelling for octagonal grid ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree sequences of matrogenic graphs
- \(\lambda\)-coloring matrogenic graphs
- \(L(h,k)\)-labelings of Hamming graphs
- Star matching and distance two labelling
- Relating path coverings to vertex labellings with a condition at distance two
- Labeling trees with a condition at distance two.
- On \(L(d,1)\)-labelings of graphs
- Labelling graphs with the circular difference
- Cyclic labellings with constraints at two distances
- Multiple \(L(j,1)\)-labeling of the triangular lattice
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- A survey on labeling graphs with a condition at distance two
- Real Number Channel Assignments for Lattices
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Hamiltonicity and circular distance two labellings
This page was built for publication: On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
