Pages that link to "Item:Q3508549"
From MaRDI portal
The following pages link to Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549):
Displayed 5 items.
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity (Q3502644) (← links)
- A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices (Q5106724) (← links)