Pages that link to "Item:Q5747730"

The following pages link to The<i>k</i>-neighbourhood-covering problem on interval graphs (Q5747730):

Displaying 3 items.

• \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
• An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
• Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)