Add to ORKGWe introduce a new notion that connects the combinatorial concept of regularity with the geometrical notion of face-transitivity. This new notion implies finiteness results in case of bounded maximal face size. We give lists of structures for some classes and investigate polyhedra with constant vertex degree and faces of only two sizes
The last 15 years have seen a significant progress in the development of general purpose algorithms ...
According to the face-spiral conjecture, first made in connection with enumeration of fullerenes, a ...
AbstractWe define general Laman (count) conditions for edges and faces of polygonal partitions in th...
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper...
We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over al...
Combinatorially regular polyhedra are polyhedral realizations (embeddings) in Euclidean 3-space E3 o...
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n ha...
AbstractLet G=G(V,E,F) be a polyhedral graph with vertex set V, edge set E and face set F. A face α ...
AbstractFor natural families of polytopes determined by substructures (e.g., tours or matchings) of ...
A bisubmodular polyhedron is defined in terms of a so-called bisubmodular function on a familiy of o...
According to the face-spiral conjecture, first made in connection with enumeration of fullerenes, a ...
Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular ...
In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensio...
The last 15 years have seen a significant progress in the development of general purpose algorithms ...
According to the face-spiral conjecture, first made in connection with enumeration of fullerenes, a ...
AbstractWe define general Laman (count) conditions for edges and faces of polygonal partitions in th...
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper...
We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over al...
Combinatorially regular polyhedra are polyhedral realizations (embeddings) in Euclidean 3-space E3 o...
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n ha...
AbstractLet G=G(V,E,F) be a polyhedral graph with vertex set V, edge set E and face set F. A face α ...
AbstractFor natural families of polytopes determined by substructures (e.g., tours or matchings) of ...
A bisubmodular polyhedron is defined in terms of a so-called bisubmodular function on a familiy of o...
According to the face-spiral conjecture, first made in connection with enumeration of fullerenes, a ...
Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular ...
In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensio...
The last 15 years have seen a significant progress in the development of general purpose algorithms ...
According to the face-spiral conjecture, first made in connection with enumeration of fullerenes, a ...
AbstractWe define general Laman (count) conditions for edges and faces of polygonal partitions in th...