Recursive generation of partitionable graphs

DOI10.1002/JGT.10067MaRDI QIDQ4798118zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Endre Boros, Stefan Hougardy, Vladimir Gurvich

Publication date 19 March 2003

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10067

zbMATH Keywords

chromatic numbercliquesstrong perfect graph conjecture

Mathematics Subject Classification ID

Perfect graphs (05C17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The strong perfect graph theorem
• Progress on perfect graphs
• Perfect graphs, partitionable graphs and cutsets
• On the strong perfect graph conjecture
• scientific article; zbMATH DE number 1789914

Cited in

(9)

• Vertex- and edge-minimal and locally minimal graphs
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• Cayley partitionable graphs and near-factorizations of finite groups
• Regenerative partition structures
• Structure of cubic Lehman matrices
• A Berge-keeping operation for graphs
• More on discrete convexity
• The strong perfect graph theorem
• Decomposing Berge graphs containing no proper wheel, long prism or their complements

This page was built for publication: Recursive generation of partitionable graphs

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