Pages that link to "Item:Q2201995"
From MaRDI portal
The following pages link to Algorithm and hardness results on neighborhood total domination in graphs (Q2201995):
Displaying 5 items.
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs (Q1702824) (← links)
- Differentiating-total domination: approximation and hardness results (Q2034786) (← links)
- Bounds on neighborhood total domination number in graphs (Q2321595) (← links)
- Neighbourhood total domination in graphs (Q3093022) (← links)
- Nearest neighbour graph realizability is NP-hard (Q5096336) (← links)