Pages that link to "Item:Q1421481"
From MaRDI portal
The following pages link to On the computational complexity of upper total domination (Q1421481):
Displaying 12 items.
- On the computational complexity of upper fractional domination (Q753848) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Edge weighting functions on semitotal dominating sets (Q2014223) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- A note on the locating-total domination in graphs (Q2364093) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Complexity of Total {k}-Domination and Related Problems (Q3004664) (← links)
- (Q3341896) (← links)
- Well-totally-dominated graphs (Q3390049) (← links)
- Edge Weighting Functions on Dominating Sets (Q4916094) (← links)
- Linear programming approach for various domination parameters (Q5859511) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)