Pages that link to "Item:Q944750"
From MaRDI portal
The following pages link to Feedback vertex set on AT-free graphs (Q944750):
Displaying 12 items.
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS (Q2890989) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- (Q3304141) (← links)
- (Q5009483) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
