Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3513556 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3291000 (Why is no real title available?)
- scientific article; zbMATH DE number 3197060 (Why is no real title available?)
- A characterization of perfect graphs
- Blocking and anti-blocking pairs of polyhedra
- Edmonds polytopes and a hierarchy of combinatorial problems
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Matroids and the greedy algorithm
- Maximum matching and a polyhedron with 0,1-vertices
- Minimum partition of a matroid into independent subsets
- Normal hypergraphs and the perfect graph conjecture
- On the facial structure of set packing polyhedra
- Properties of vertex packing and independence system polyhedra
- The lexicographic product of graphs
- Topology of series-parallel networks
Cited in
(only showing first 100 items - show all)- Some facets of the simple plant location polytope
- On the linear extension complexity of stable set polytopes for perfect graphs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
- Hamiltonicity and combinatorial polyhedra
- Characterising claw-free \(t\)-perfect graphs
- On a graph partition problem with application to VLSI layout
- On the set covering polyhedron of circulant matrices
- The maximum \(k\)-colorable subgraph problem and orbitopes
- Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs
- The complexity of facets (and some facets of complexity)
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas
- Perfect graphs are kernel solvable
- Matrices with the Edmonds-Johnson property
- On the stable set polytope of a series-parallel graph
- Two poset polytopes
- On cutting-plane proofs in combinatorial optimization
- A polyhedral investigation of star colorings
- Perfect graphs, kernels, and cores of cooperative games
- Fair cost allocations under conflicts - a game-theoretic point of view -
- On the behavior of the \(N_{+}\)-operator under blocker duality
- Graph imperfection. I
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- On the X-join decomposition for undirected graphs
- New facets for the set packing polytope
- Entropy splitting for antiblocking corners and perfect graphs
- A polyhedral approach to the stability of a family of coalitions
- Matroidal graphs
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
- The complexity of recognizing linear systems with certain integrality properties
- Adjacency on combinatorial polyhedra
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- On classes of minimal circular-imperfect graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Z-transformation graphs of perfect matchings of hexagonal systems
- The complexity of facets resolved
- Gear composition and the stable set polytope
- Entropy of symmetric graphs
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Relaxations of vertex packing
- On claw-free \(t\)-perfect graphs
- A lower bound for the job insertion problem.
- Separation problems for the stable set polytope
- Coloring planar Toeplitz graphs and the stable set polytope.
- On the 0,1 facets of the set covering polytope
- On the facial structure of the set covering polytope
- Special simplices and Gorenstein toric rings.
- Polytope des independants d'un graphe série-parallèle
- Stability critical graphs and ranks facets of the stable set polytope
- Existence of unimodular triangulations -- positive results
- Facets and algorithms for capacitated lot sizing
- Vertex packings: Structural properties and algorithms
- \(K_ i\)-covers. I: Complexity and polytopes
- Applying Lehman's theorems to packing problems
- Comparing imperfection ratio and imperfection index for graph classes
- Constructions for normal graphs and some consequences
- Near-perfect matrices
- The facets and the symmetries of the approval-voting polytope
- Decomposition of Directed Graphs
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
- The maximum clique problem
- A generalization of antiwebs to independence systems and their canonical facets
- Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type
- Strength of facets for the set covering and set packing polyhedra on circulant matrices
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- Properties of vertex packing and independence system polyhedra
- Partitive hypergraphs
- Rank of maximum matchings in a graph
- Universally signable graphs
- Perfect zero–one matrices
- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
- On the facets of the simple plant location packing polytope
- Claw-free \(t\)-perfect graphs can be recognized in polynomial time
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- On balanced graphs
- Almost all webs are not rank-perfect
- A comparison between lift-and-project indices and imperfection ratio on web graphs
- Row family inequalities for the set covering polyhedron
- The projected faces property and polyhedral relations
- Composition of stable set polyhedra
- Balanced matrices
- Adjacency on polymatroids
- On the enumeration of certain weighted graphs
- STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs
- Polyhedral proof methods in combinatorial optimization
- The stable set polytope for some extensions of \(P_4\)-free graphs
- A solvable case of quadratic 0-1 programming
- Adjacency on the order polytope with applications to the theory of fuzzy measures
- Stable sets and polynomials
- 2-clique-bond of stable set polyhedra
- Line perfect graphs
- Clique and chromatic number of circular-perfect graphs
- Perfectness of clustered graphs
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs
- A note on node packing polytopes on hypergraphs
- On perfect \(0,\pm 1\) matrices
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- A characterization of PM-compact Hamiltonian bipartite graphs
This page was built for publication: On certain polytopes associated with graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393418)
