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

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

zbMATH Keywords

perfect graphs

Mathematics Subject Classification ID

Perfect graphs (05C17)

Cited In (10)

• Recursive generation of partitionable graphs
• Cutsets in perfect and minimal imperfect graphs
• An approach to solving \(A^{k}=J-I\)
• A class of perfect graphs containing \(P_{6}\)
• Title not available (Why is that?)
• Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• On strongly stable graphs and some consequences for partitionable graphs
• Star-cutsets and perfect 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)