The following pages link to (Q4281625):
Displayed 10 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- A feedback vertex set of 2-degenerate graphs (Q300250) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)