Pages that link to "Item:Q1701093"
From MaRDI portal
The following pages link to Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093):
Displayed 9 items.
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
- (Q5874491) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)