The following pages link to The three-in-a-tree problem (Q653792):
Displaying 32 items.
- Detecting an induced net subdivision (Q461729) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- CIO and ring graphs: deficiency and testing (Q507135) (← links)
- The \(k\)-in-a-tree problem for graphs of girth at least \(k\) (Q602681) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- The four-in-a-tree problem in triangle-free graphs (Q844235) (← links)
- Finding induced trees (Q967418) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Detecting a long even hole (Q2143407) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Detecting an induced subdivision of \(K_{4}\) (Q2413192) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs (Q4632025) (← links)
- A Class of Three‐Colorable Triangle‐Free Graphs (Q4916101) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- (Q5743476) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- Finding an induced subdivision of a digraph (Q5891097) (← links)
- Detecting induced subgraphs (Q5900072) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)