scientific article; zbMATH DE number 3390792
From MaRDI portal
Publication:5659563
Cited in
(23)- Perfectness of normal products of graphs
- Graphical properties related to minimal imperfection
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- Parity graphs are kernel-M-solvable
- Perfect zero–one matrices
- A class of facet producing graphs for vertex packing polyhedra
- On kernels in i-triangulated graphs
- Zur Theorie der perfekten Graphen
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- On box-perfect graphs
- Word-representability of graphs with respect to split recomposition
- Perfect product graphs
- Almost integral polyhedra related to certain combinatorial optimization problems
- Minimax relations for the partial q-colorings of a graph
- Motivations and history of some of my conjectures
- Normal hypergraphs and the perfect graph conjecture
- On the strong perfect graph conjecture and critical graphs
- Classes of perfect graphs
- On circulant thin Lehman matrices
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Some inequalities on the chromatic number of a graph
- Normal hypergraphs and the perfect graph conjecture. (Reprint)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659563)
