Short-chorded and perfect graphs

DOI10.1016/0095-8956(91)90003-3zbMath0755.05072OpenAlexW2014243528MaRDI QIDQ1174781

Anna Lubiw

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(91)90003-3

zbMATH Keywords

perfect graphsshort chordshort-chorded graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items (5)

Slightly triangulated graphs are perfect ⋮ On the optimal transversals of the odd cycles ⋮ A new class of perfect Hoàng graphs ⋮ Recognition of quasi-Meyniel graphs ⋮ On minimal imperfect graphs without induced \(P_5\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Weakly triangulated graphs
• New classes of perfect graphs
• Alternating orientation and alternating colouration of perfect graphs
• A new property of critical imperfect graphs and some consequences
• Star-cutsets and perfect graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• A characterization of perfect graphs
• On a property of the class of n-colorable graphs
• Representation of a finite graph by a set of intervals on the real line
• Transformations which Preserve Perfectness and H-Perfectness of Graphs

This page was built for publication: Short-chorded and perfect graphs