The strong perfect graph conjecture holds for diamonded odd cycle-free graphs

Abstract

We define a diamonded odd cycle to be an odd cycle C with exactly two chords and either a) C has length five and the two chords are non-crossing; or b) C has length greater than five and has chords (x,y) and (x,z) with (y,z) an edge of C and there exists a node w not on C adjacent to y and C, but not x. In this paper, we show that given a diamonded odd… (More)
DOI: 10.1016/0012-365X(92)90697-E

Topics

10 Figures and Tables

Cite this paper

@article{Carducci1992TheSP, title={The strong perfect graph conjecture holds for diamonded odd cycle-free graphs}, author={Olivia M. Carducci}, journal={Discrete Mathematics}, year={1992}, volume={110}, pages={17-34} }