Vertex-vectors of quadrangular 3-polytopes with two types of edges
S. Jendrol, E. Jucovič, M. Trenkler (1989)
Banach Center Publications
Similarity:
Displaying similar documents to “All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5”
Vertex-vectors of quadrangular 3-polytopes with two types of edges
An extension of Kotzig’s theorem on the minimum weight of edges in -polytopes
Oleg V. Borodin (1992)
Mathematica Slovaca
Similarity:
Gaps in the Numbers of Vertices of Cubical Polytopes, I.
R. Blind, G. Blind (1994)
Discrete & computational geometry
Similarity:
On the monotone upper bound problem.
Pfeifle, Julian, Ziegler, Günter M. (2004)
Experimental Mathematics
Similarity:
Clique-connecting forest and stable set polytopes
Denis Cornaz (2010)
RAIRO - Operations Research
Similarity:
Let be a simple undirected graph. A forest ⊆ of is said to be if each tree of spans a clique of . This paper adresses the clique-connecting forest polytope. First we give a formulation and a polynomial time separation algorithm. Then we show that the nontrivial nondegenerate facets of the stable set polytope are facets of the clique-connecting polytope. Finally we introduce a family of rank inequalities which are facets, and which generalize the clique inequalities. ...
Flag vectors of multiplicial polytopes.
Bayer, Margaret M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two signed associahedra.
Burgiel, H., Reiner, V. (1998)
The New York Journal of Mathematics [electronic only]
Similarity:
On non-inscribable polytopes
Branko Grünbaum, Ernest Jucovič (1974)
Czechoslovak Mathematical Journal
Similarity:
The lonely vertex problem.
Frettlöh, D., Glazyrin, A. (2009)
Beiträge zur Algebra und Geometrie
Similarity: