The following pages link to Detecting a Theta or a Prism (Q3394995):
Displaying 11 items.
- Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs (Q372841) (← links)
- CIO and ring graphs: deficiency and testing (Q507135) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- The three-in-a-tree problem (Q653792) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- Detecting a long even hole (Q2143407) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- (Q5743476) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)