Slightly triangulated graphs are perfect

DOI10.1007/BF02986675zbMath0814.05035MaRDI QIDQ1340126

Frédéric Maire

Publication date: 9 February 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

perfect graphschordless cyclechordless pathslightly triangulated graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Classes of perfect graphs

Cites Work

• A characterization of intersection graphs of the maximal rectangles of a polyomino
• Topics on perfect graphs
• Weakly triangulated graphs
• Short-chorded and perfect graphs
• Optimizing weakly triangulated graphs
• On a property of the class of n-colorable graphs
• Perfect zero–one matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Slightly triangulated graphs are perfect