The following pages link to Detecting induced subgraphs (Q5900072):
Displaying 24 items.
- Graph editing to a fixed target (Q344855) (← links)
- Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs (Q372841) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- 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)
- Partial characterizations of circle graphs (Q643006) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- Containment relations in split graphs (Q765349) (← links)
- The four-in-a-tree problem in triangle-free graphs (Q844235) (← links)
- Finding induced trees (Q967418) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← 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)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)
