Pages that link to "Item:Q1786595"
From MaRDI portal
The following pages link to Vertex deletion problems on chordal graphs (Q1786595):
Displaying 18 items.
- Graph modification problem for some classes of graphs (Q350726) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Deletion graph problems based on deadlock resolution (Q2412401) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← links)
- Algorithms for deletion problems on split graphs (Q2656339) (← links)
- On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
- On some simplicial elimination schemes for chordal graphs (Q2839220) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- Tight Running Time Lower Bounds for Vertex Deletion Problems (Q4973874) (← links)
- Node-and edge-deletion NP-complete problems (Q5402565) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5919400) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
