-vectors, Eulerian polynomials and stable polytopes of graphs.
Athanasiadis, Christos A. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Athanasiadis, Christos A. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bayer, Margaret M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alon, N., Kleitman, D.J. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Duško Jojić (2007)
Publications de l'Institut Mathématique
Similarity:
McMullen, Peter (1993)
Beiträge zur Algebra und Geometrie
Similarity:
Branko Grünbaum, Ernest Jucovič (1974)
Czechoslovak Mathematical Journal
Similarity:
Bayer, Margaret M., Bisztriczky, Tibor (2008)
Beiträge zur Algebra und Geometrie
Similarity:
Bezdek, K., Hausel, T. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
G. Panina (2003)
Open Mathematics
Similarity:
All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual polytope.
N. Prabhu (1995)
Discrete & computational geometry
Similarity: