Pages that link to "Item:Q2398208"

The following pages link to Polynomial kernelization for removing induced claws and diamonds (Q2398208):

Displaying 11 items.

• A polynomial kernel for trivially perfect editing (Q1799208) (← links)
• Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
• Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
• Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations (Q2077398) (← links)
• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
• Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
• A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
• A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
• (Q5874544) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Algorithms for subgraph complementation to some classes of graphs (Q6663515) (← links)