scientific article; zbMATH DE number 3390792

zbMath0247.05116MaRDI QIDQ5659563

Horst Sachs

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Motivations and history of some of my conjectures, Parity graphs are kernel-M-solvable, Graphical properties related to minimal imperfection, On box-perfect graphs, Zur Theorie der perfekten Graphen, Classes of perfect graphs, Unnamed Item, On the strong perfect graph conjecture and critical graphs, On circulant thin Lehman matrices, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, Some inequalities on the chromatic number of a graph, A class of facet producing graphs for vertex packing polyhedra, Normal hypergraphs and the perfect graph conjecture. (Reprint), Almost integral polyhedra related to certain combinatorial optimization problems, Perfect product graphs, Perfectness of normal products of graphs, On kernels in i-triangulated graphs, Minimax relations for the partial q-colorings of a graph, Normal hypergraphs and the perfect graph conjecture, Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Perfect zero–one matrices