Pages that link to "Item:Q487013"
From MaRDI portal
The following pages link to Parameterized complexity of induced graph matching on claw-free graphs (Q487013):
Displayed 11 items.
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Correction to: ``A connection between sports and matroids: how many teams can we beat?'' (Q1755751) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- (Q4691867) (← links)
- Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)