Recursive generation of partitionable graphs

DOI10.1002/jgt.10067zbMath1018.05040OpenAlexW4246787658WikidataQ59560646 ScholiaQ59560646MaRDI QIDQ4798118

Stefan Hougardy, Endre Boros, Vladimir A. 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

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

Related Items (5)

A Berge-keeping operation for graphs ⋮ Cayley partitionable graphs and near-factorizations of finite groups ⋮ Structure of cubic Lehman matrices ⋮ Vertex- and edge-minimal and locally minimal graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution

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