The following pages link to Theoretical Computer Science (Q5395075):
Displaying 4 items.
- The \(L(d,1)\)-number of powers of paths (Q1025974) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)