Pages that link to "Item:Q4284972"
From MaRDI portal
The following pages link to On the complexity of domination number determination in monogenic classes of graphs (Q4284972):
Displaying 4 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
