A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Detecting a Theta or a Prism
2008
SIAM Journal on Discrete Mathematics
Preserved Fulltext
A theta in a graph is an induced subgraph consisting of two nonadjacent vertices joined by three disjoint paths. A prism in a graph is an induced subgraph consisting of two disjoint triangles joined by three disjoint paths. This paper gives a polynomial-time algorithm to test whether a graph has an induced subgraph that is either a prism or a theta.
doi:10.1137/060672613
fatcat:rlomoao4incobj6hg6fiki6kce