Pages that link to "Item:Q2019430"

The following pages link to Linear-time algorithms for eliminating claws in graphs (Q2019430):

Displaying 4 items.

• Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
• Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
• On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
• On the \(d\)-claw vertex deletion problem (Q6182678) (← links)