Highly Influenced

# Algorithms for perfectly contractile graphs

@article{Maffray2005AlgorithmsFP, title={Algorithms for perfectly contractile graphs}, author={Fr{\'e}d{\'e}ric Maffray and Nicolas Trotignon}, journal={SIAM J. Discrete Math.}, year={2005}, volume={19}, pages={553-574} }

- Published 2005 in SIAM J. Discrete Math.
DOI:10.1137/S0895480104442522

We consider the class A of graphs that contain no odd hole, no antihole of length at least 5, and no “prism” (a graph consisting of two disjoint triangles with three disjoint paths between them) and the class A′ of graphs that contain no odd hole, no antihole of length at least 5, and no odd prism (prism whose three paths are odd). These two classes were introduced by Everett and Reed and are relevant to the study of perfect graphs. We give polynomial-time recognition algorithms for these two… CONTINUE READING

Recent Discussions

This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

#### From This Paper

##### Figures, tables, and topics from this paper.

25 Citations

15 References

Similar Papers