The following pages link to Detecting induced subgraphs (Q5900072):
Displaying 14 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)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)