On quadrangular convex 3-polytopes with at most two types of edges
نویسندگان
چکیده
منابع مشابه
Chromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملAn inequality concerning edges of minor weight in convex 3-polytopes
Let eij be the number of edges in a convex 3–polytope joining the vertices of degree i with the vertices of degree j. We prove that for every convex 3-polytope there is 20e3,3 +25e3,4 +16e3,5 +10e3,6 + 6 2 3 e3,7+5e3,8+2 1 2 e3,9+2e3,10+16 2 3 e4,4+11e4,5+5e4,6+1 2 3 e4,7+5 1 3 e5,5+ 2e5,6 ≥ 120; moreover, each coefficient is the best possible. This result brings a final answer to the conjectur...
متن کاملCombinatorially Two-Orbit Convex Polytopes
Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group coincide). Hence, a combinatorially two-orbit convex polytope is isomorphic to one of a known finite list, all of which are 3-dimensional: the cuboctahedron, i...
متن کاملOn polytopes simple in edges
In this paper, we will study the h-vectors of a slightly more general class of polytopes. A d-polytope is called simple in edges if each its edge is incident exactly to d − 1 facets. We will prove that for any polytope simple in edges all numbers h[d/2], h[d/2]+1,. . ., hd are nonnegative and hk 6 hd−k for k 6 d/2. Polytopes simple in edges appear for instance as (closures of) fundamental polyh...
متن کاملMinimum Convex Container of Two Convex Polytopes under Translations
Given two convex d-polytopes P and Q in R for d ≥ 3, we study the problem of bundling P and Q in a smallest convex container. More precisely, our problem asks to find a minimum convex set containing P and Q that are in contact under translations. For dimension d = 3, we present the first exact algorithm that runs in O(n) time, where n denotes the number of vertices of P and Q. Our approach easi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90185-4