Pages that link to "Item:Q491619"
From MaRDI portal
The following pages link to On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619):
Displaying 6 items.
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Approximating partially bounded degree deletion on directed graphs (Q1641092) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)