scientific article
From MaRDI portal
Publication:2758338
zbMath0990.05055MaRDI QIDQ2758338
András Sebő, Myriam Preissmann
Publication date: 7 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
chromatic numberclique numberperfect graphsstrong perfect graph conjecturepartitionable graphsminimal imperfect graphs
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)
Related Items (4)
Perfect graphs, kernels, and cores of cooperative games ⋮ Grinstead's conjecture is true for graphs with a small clique number ⋮ An approach to solving \(A^{k}=J-I\) ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution
This page was built for publication:
