Pages that link to "Item:Q410736"
From MaRDI portal
The following pages link to A decidability result for the dominating set problem (Q410736):
Displaying 6 items.
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648) (← links)
- Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
- Domination problems with no conflicts (Q1752590) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- (Q3341896) (← links)