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}
}
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
25 Citations
15 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Problem session on parity problems (Public communication)

  • B. A. Reed
  • DIMACS Workshop on Perfect Graphs, Princeton…
  • 1993
Highly Influential
4 Excerpts

Cleaning for Bergeness

  • M. Chudnovsky, G. Cornuéjols, X. Liu, P. Seymour, K. Vušković
  • Manuscript
  • 2002
Highly Influential
7 Excerpts

A class of perfectly contractile graphs

  • N. Trotignon Maffray
  • Research report
  • 1997

Graphs

  • C. Berge
  • North-Holland, Amsterdam/New York
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…