The following pages link to Detecting an Odd Hole (Q5133961):
Displaying 8 items.
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Detecting a long odd hole (Q2035985) (← links)
- Detecting a long even hole (Q2143407) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
- Shortest odd paths in undirected graphs with conservative weight functions (Q6611004) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)