scientific article; zbMATH DE number 3420800
From MaRDI portal
Publication:5685113
Cited in
(22)- Relaxations of vertex packing
- On randomized stopping points and perfect graphs
- On infinite perfect graphs and randomized stopping points on the plane
- Graphical properties related to minimal imperfection
- A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
- On stable set polyhedra for K//(1,3)free graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- A class of facet producing graphs for vertex packing polyhedra
- Almost integral polyhedra related to certain combinatorial optimization problems
- Critical perfect graphs and perfect 3-chromatic graphs
- Near-perfect matrices
- The facets and the symmetries of the approval-voting polytope
- On perfect graphs and polyhedra with (0, 1)-valued extreme points
- Finite checkability for integer rounding properties in combinatorial programming problems
- Line perfect graphs
- Perfect zero–one matrices
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
- The maximum k-colorable subgraph problem and orbitopes
- -boundedness and related problems on graphs without long induced paths: a survey
- On the structure of (dart, odd hole)-free graphs
- Entropy splitting for antiblocking corners and perfect graphs
- On the complexity of bandwidth allocation in radio networks
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 Q5685113)
