Pages that link to "Item:Q2820195"
From MaRDI portal
The following pages link to On the complexity of strong and weak total domination in graphs (Q2820195):
Displaying 9 items.
- More results on the complexity of domination problems in graphs (Q1664084) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On parameters related to strong and weak domination in graphs (Q1850037) (← links)
- A note on the locating-total domination in graphs (Q2364093) (← links)
- Weak total domination in graphs (Q2878216) (← links)
- Complexity of Total {k}-Domination and Related Problems (Q3004664) (← links)
- The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
- Independent strong weak domination: A mathematical programming approach (Q5858171) (← links)
- (Q5886294) (← links)