Pages that link to "Item:Q5146828"

The following pages link to A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (Q5146828):

Displaying 2 items.

• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)