On n-fold L(j,k)-and circular L(j,k)-labelings of graphs
From MaRDI portal
(Redirected from Publication:714037)
On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
Recommendations
- \(L(2, 1)\)-labeling of circulant graphs
- On circular-L(2,1)-edge-labeling of graphs
- On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- \(L(3,1)\)-labeling of circulant graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- \(L(j,k)\)-labelings and \(L(j,k)\)-edge-labelings of graphs.
- On circular-L(2, 1)-labellings of products of graphs
- \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
- On \(L(d,1)\)-labelings of graphs
Cites work
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- scientific article; zbMATH DE number 2197889 (Why is no real title available?)
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- A survey on labeling graphs with a condition at distance two
- Approximations for -Colorings of Graphs
- Cyclic labellings with constraints at two distances
- Degree sequences of matrogenic graphs
- Graph labeling and radio channel assignment
- Hamiltonicity and circular distance two labellings
- Labeling trees with a condition at distance two.
- Labelling Graphs with a Condition at Distance 2
- Labelling graphs with the circular difference
- Multiple \(L(j,1)\)-labeling of the triangular lattice
- On \(L(d,1)\)-labelings of graphs
- Real Number Channel Assignments for Lattices
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- Relating path coverings to vertex labellings with a condition at distance two
- Star matching and distance two labelling
- The $L(2,1)$-Labeling Problem on Graphs
- \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- \(L(h,k)\)-labelings of Hamming graphs
- \(\lambda\)-coloring matrogenic graphs
Cited in
(6)- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs
- \(L(h, k)\)-labelling for octagonal grid
- Multiple \(L(j,1)\)-labeling of the triangular lattice
- n-fold L(2, 1)-labelings of Cartesian product of paths and cycles
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
This page was built for publication: On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714037)
