# Detecting a Theta or a Prism

@article{Chudnovsky2008DetectingAT, title={Detecting a Theta or a Prism}, author={M. Chudnovsky and Rohan Kapadia}, journal={SIAM J. Discret. Math.}, year={2008}, volume={22}, pages={1164-1186} }

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.

## 32 Citations

Detecting wheels

- MathematicsArXiv
- 2013

It is proved that the problem whose instance is a graph G and whose question is “does G contains a wheel as an induced subgraph” is NP-complete.

Graphs with no induced wheel or antiwheel

- MathematicsArXiv
- 2015

It is shown here that graphs that contain no wheel and no antiwheel have a very simple structure and consequently can be recognized in polynomial time.

The three-in-a-tree problem

- MathematicsComb.
- 2010

It is shown that there is a polynomial time algorithm that, given three Vertices of a graph, tests whether there is an induced subgraph that is a tree, containing the three vertices, and an alternative way to test whether a graph contains a “pyramid” (a fundamental step in checking whether a graphs is perfect.

Testing for a theta

- MathematicsSODA '07
- 2007

A new algorithm to test if a graph contains a special kind of an induced subgraph, called a "theta" is presented, to test whether a given graph contains certaininduced subgraphs.

A Class of Three‐Colorable Triangle‐Free Graphs

- MathematicsJ. Graph Theory
- 2013

If all subdivisions of K2, 3 are also excluded as induced subgraphs, then the chromatic number becomes bounded by 3, and a structural characterization of this class of graphs is given, from which an coloring algorithm is derived.

Excluding induced subgraphs

- Mathematics
- 2006

In this paper we survey some results concerning the structure and properties of families of graphs defined by excluding certain induced subgraphs, including perfect graphs, claw-free graphs,…

Perfect graphs: a survey

- MathematicsArXiv
- 2013

A survey about perfect graphs, mostly focused on the strong perfect graph theorem, which was proved by Chudnovsky, Robertson, Seymour and Thomas in 2002.

A faster algorithm to recognize even-hole-free graphs

- Computer ScienceJ. Comb. Theory, Ser. B
- 2012

Separability and Vertex Ordering of Graphs

- Mathematics
- 2019

Many graph optimization problems, such as finding an optimal coloring, or a largest clique, can be solved by a divide-and-conquer approach. One such well-known technique is decomposition by clique…

## References

SHOWING 1-4 OF 4 REFERENCES

Recognizing Berge Graphs

- MathematicsComb.
- 2005

This paper gives an algorithm to test if a graph G is Berge, with running time O(|V (G)|9), independent of the recent proof of the strong perfect graph conjecture.

The three-in-a-tree problem

- MathematicsComb.
- 2010

It is shown that there is a polynomial time algorithm that, given three Vertices of a graph, tests whether there is an induced subgraph that is a tree, containing the three vertices, and an alternative way to test whether a graph contains a “pyramid” (a fundamental step in checking whether a graphs is perfect.

Algorithms for Perfectly Contractile Graphs

- MathematicsSIAM J. Discret. Math.
- 2005

It is proved that determining if a general graph contains a prism (or an even prism, or an odd prism) is NP-complete.

Testing balancedness and perfection of linear matrices

- MathematicsMath. Program.
- 1993

This paper gives polynomial algorithms to test whether a linear matrix is balanced or perfect, based on decomposition results previously obtained by the authors.