Detecting a Theta or a Prism
From MaRDI portal
Publication:3394995
Recommendations
Cited in
(12)- Testing for a theta
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- Finding a shortest even hole in polynomial time
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- FPT and kernelization algorithms for the induced tree problem
- Detecting a long even hole
- A faster algorithm to recognize even-hole-free graphs
- The three-in-a-tree problem
- Partial characterizations of circle graphs
- The sandwich problem for decompositions and almost monotone properties
- Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs
- CIO and ring graphs: deficiency and testing
This page was built for publication: Detecting a Theta or a Prism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394995)