Pages that link to "Item:Q1393418"
From MaRDI portal
The following pages link to On certain polytopes associated with graphs (Q1393418):
Displaying 50 items.
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- Two poset polytopes (Q1077721) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- On randomized stopping points and perfect graphs (Q1085176) (← links)
- On infinite perfect graphs and randomized stopping points on the plane (Q1093246) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- On the stable set polytope of a series-parallel graph (Q1106858) (← links)
- The complexity of facets resolved (Q1109565) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Perfect graphs are kernel solvable (Q1126176) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- On the X-join decomposition for undirected graphs (Q1142232) (← links)
- Hamiltonicity and combinatorial polyhedra (Q1147161) (← links)
- Polytope des independants d'un graphe série-parallèle (Q1147168) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Adjacent vertices on the b-matching polyhedron (Q1156817) (← links)
- A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467) (← links)
- Partitive hypergraphs (Q1160636) (← links)
- On the use of augmenting chains in chain packings (Q1174179) (← links)
- Perfect graphs and norms (Q1177234) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- On a graph partition problem with application to VLSI layout (Q1199941) (← links)
- Matroidal graphs (Q1244250) (← links)
- Adjacency on the constrained assignment problem (Q1270787) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- The maximum clique problem (Q1318271) (← links)
- Polyhedral consequences of the amalgam operation (Q1331977) (← links)
- Near-perfect matrices (Q1332310) (← links)
- A decomposition of 2-weak vertex-packing polytopes (Q1338460) (← links)
- Vertex packing problem application to the design of electronic testing fixtures (Q1339134) (← links)
- Characterizing consistency in probabilistic logic for a class of Horn clauses (Q1340063) (← links)
- On perfect \(0,\pm 1\) matrices (Q1356731) (← links)
- Universally signable graphs (Q1375057) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- Rank inequalities and separation algorithms for packing designs and sparse triple systems. (Q1401311) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Coloring planar Toeplitz graphs and the stable set polytope. (Q1422423) (← links)
- The weakly connected independent set polytope in corona and join of graphs (Q1631656) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- On the perfect matching graph defined by a set of cycles (Q1694978) (← links)
