Pages that link to "Item:Q5145012"
From MaRDI portal
The following pages link to Three-in-a-tree in near linear time (Q5145012):
Displayed 7 items.
- Detecting a long odd hole (Q2035985) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Detecting a long even hole (Q2143407) (← links)
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)