On certain polytopes associated with graphs

@article{Chvtal1975OnCP,
  title={On certain polytopes associated with graphs},
  author={V. Chv{\'a}tal},
  journal={Journal of Combinatorial Theory, Series B},
  year={1975},
  volume={18},
  pages={138-154}
}
  • V. Chvátal
  • Published 1975
  • Mathematics
  • Journal of Combinatorial Theory, Series B
558 Citations
Cycle decompositions and t-perfect graphs
  • Highly Influenced
Vertex adjacencies in the set covering polyhedron
  • 10
  • Highly Influenced
  • PDF
Polyhedral studies of vertex coloring problems: The standard formulation
  • 4
  • Highly Influenced
  • PDF
Perfect graphs: a survey
  • 19
  • Highly Influenced
  • PDF
Des multiples facettes des graphes circulants
  • 1
  • Highly Influenced
  • PDF
A min-max relation for stable sets in graphs with no odd-K4
  • B. Gerards
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1989
  • 33
  • Highly Influenced
  • PDF
Birkhoff-von Neumann Graphs that are PM-Compact
  • Highly Influenced
  • PDF
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets
  • 3
  • Highly Influenced
  • PDF
Polytopes of independent sets of relations and their 1-skeleta
  • Highly Influenced
On $t$-perfect triangulations of the projective plane
  • 3
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Perfect zero–one matrices
  • M. Padberg
  • Mathematics, Computer Science
  • Math. Program.
  • 1974
  • 237
  • PDF
Properties of vertex packing and independence system polyhedra
  • 301
Edmonds polytopes and a hierarchy of combinatorial problems
  • V. Chvátal
  • Computer Science, Mathematics
  • Discret. Math.
  • 1973
  • 593
On the facial structure of set packing polyhedra
  • M. Padberg
  • Mathematics, Computer Science
  • Math. Program.
  • 1973
  • 598
A Characterization of Perfect Graphs
  • 345
Blocking and anti-blocking pairs of polyhedra
  • 417
Matroids and the greedy algorithm
  • J. Edmonds
  • Mathematics, Computer Science
  • Math. Program.
  • 1971
  • 735
  • PDF
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
  • STOC '71
  • 1971
  • 6,173
  • PDF
...
1
2
...