scientific article
From MaRDI portal
Publication:3946199
zbMath0486.05054MaRDI QIDQ3946199
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
holesstability numberchromatic numberperfect graph conjecturecritical perfect graphantiholesclique-covering number3- chromatic graphsmaximum clique size number
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
An approach to solving \(A^{k}=J-I\) ⋮ A classification of certain graphs with minimal imperfection properties ⋮ On stable set polyhedra for K//(1,3)free graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution
