Pages that link to "Item:Q1006083"
From MaRDI portal
The following pages link to On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083):
Displaying 5 items.
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Mind the independence gap (Q776261) (← links)
- Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
