Pages that link to "Item:Q2285114"
From MaRDI portal
The following pages link to Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS (Q2285114):
Displaying 5 items.
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- A polynomial kernel for funnel arc deletion set (Q2161012) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- A Polynomial Kernel for Funnel Arc Deletion Set. (Q6089658) (← links)