Pages that link to "Item:Q3921261"
From MaRDI portal
The following pages link to Node-Deletion Problems on Bipartite Graphs (Q3921261):
Displayed 5 items.
- (Q5225203) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Between 2- and 3-colorability (Q5902303) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)