zbMATH — the first resource for mathematics

The graphs whose odd cycles have at least two chords. (English) Zbl 0567.05034
Perfect graphs, Ann. Discrete Math. 21, 115-119 (1984).
[For the entire collection see Zbl 0546.00006.]
The main result of this paper is the theorem: If every odd cycle of length \(\geq 5\) has at least two chords, then the graph is perfect.
Reviewer: H.Gerber

05C38 Paths and cycles
05C35 Extremal problems in graph theory