Pages that link to "Item:Q2255037"
From MaRDI portal
The following pages link to Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037):
Displaying 11 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- Mind the independence gap (Q776261) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Independent domination versus weighted independent domination (Q2294440) (← links)
- An algorithm for calculating the independence and vertex-cover polynomials of a graph (Q2383889) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- Iterative construction of the minimum independent dominating sets in hypercube graphs (Q2677356) (← links)
- Complexity of the approximation of the independent dominating set problem in the class of \(2P_3\)-free perfect graphs (Q2837369) (← links)
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055) (← links)
- (Q5263782) (← links)