Pages that link to "Item:Q3696538"
From MaRDI portal
The following pages link to On the Algorithmic Complexity of Total Domination (Q3696538):
Displayed 22 items.
- On the complexity of the bondage and reinforcement problems (Q413470) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
- Efficient algorithms for the conditional covering problem (Q690494) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- A unified approach to domination problems on interval graphs (Q1111566) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Total domination in block graphs (Q1124531) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- On the computational complexity of upper total domination (Q1421481) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Paired domination on interval and circular-arc graphs (Q2384392) (← links)
- Total domination in interval graphs (Q5903156) (← links)
- Total domination in interval graphs (Q5903263) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)