Pages that link to "Item:Q5918768"
From MaRDI portal
The following pages link to Hardness results of global total \(k\)-domination problem in graphs (Q5918768):
Displaying 8 items.
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Hardness results of global Roman domination in graphs (Q831760) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- ``Global'' graph problems tend to be intractable (Q1820581) (← links)
- Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- On the global total $k$-domination number of graphs (Q2420407) (← links)
- Some remarks on global total domination in graphs (Q2794447) (← links)