Pages that link to "Item:Q392038"

The following pages link to Parameterized complexity of vertex deletion into perfect graph classes (Q392038):

Displaying 3 items.

• Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
• Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)