The following pages link to (Q3353058):
Displaying 12 items.
- A decidability result for the dominating set problem (Q410736) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- Independent domination in hereditary classes (Q818132) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- On easy and hard hereditary classes of graphs with respect to the independent set problem (Q1414579) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Boundary classes of graphs for the dominating set problem (Q1877644) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- A Boundary Property for Upper Domination (Q2819507) (← links)
- (Q4691865) (← links)
- (Q6054225) (← links)
