Pages that link to "Item:Q2089067"

The following pages link to On the complexity of singly connected vertex deletion (Q2089067):

Displaying 3 items.

• Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness'' (Q294778) (← links)
• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
• Vertex deletion on split graphs: beyond 4-hitting set (Q5919400) (← links)