Learn More

- E. Steigrímsson
- Discrete & Computational Geometry
- 1994

The 2{weak vertex-packing polytope of a loopless graph G with d vertices is the subset of the unit d{cube satisfying x i + x j 1 for every edge (i; j) of G. The dilation by 2 of this polytope is a polytope P with integral vertices. We triangulate P with lattice simplices of minimal volume and label the maximal simplices with elements of the hyperoctahedral… (More)

- ‹
- 1
- ›