Perfect graphs, partitionable graphs and cutsets

DOI10.1007/S004930200001zbMATH Open0996.05060DBLPjournals/combinatorica/ConfortiCGV02OpenAlexW1994475625WikidataQ59904362 ScholiaQ59904362MaRDI QIDQ700371FDOQ700371

Authors Michele Conforti, Grigor Gasparyan, Kristina Vušković, Gérard Cornuéjols

Publication date 20 October 2002

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004930200001

zbMATH Keywords

perfect graphs

Mathematics Subject Classification ID

Perfect graphs (05C17)

Recommendations

• ON A CERTAIN SUBCLASS OF (⍺, ω)-PARTITIONABLE GRAPHS
• Cutsets in perfect and minimal imperfect graphs
• Progress on perfect graphs
• Complete multi-partite cutsets in minimal imperfect graphs
• The strong perfect graph theorem

Cited in

(11)

• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• An approach to solving \(A^{k}=J-I\)
• Cutsets in perfect and minimal imperfect graphs
• ON A CERTAIN SUBCLASS OF (⍺, ω)-PARTITIONABLE GRAPHS
• Star-cutsets and perfect graphs
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
• Recursive generation of partitionable graphs
• scientific article; zbMATH DE number 1696523 (Why is no real title available?)
• On strongly stable graphs and some consequences for partitionable graphs
• A class of perfect graphs containing \(P_{6}\)
• Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs

This page was built for publication: Perfect graphs, partitionable graphs and cutsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700371)