AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional polytope is a refinement of the boundary of the tetrahedron. We show that if the graph of the polytope is 5-connected then its boundary is a refinement of the boundary of an octahedron
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
AbstractWe prove the inequality Σn≥7 (n−6) pn≤v−12 for any 3-dimensional polytope with v vertices an...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional...
Steinitz's theorem states that a graph G is the edge-graph of a 3-dimensional convex polyhedron if a...
AbstractIt is shown that if three vertices of the graph G(l') of a convex 3-polytope P are chosen, t...
AbstractA 5-dimensional convex polytope P is constructed whose graph G has the property that if it i...
Steinitz's theorem states that a graph $G$ is the edge-graph of a $3$-dimensional convex polyhedron...
AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary o...
AbstractRelations between graph theory and polyhedra are presented in two contexts. In the first, th...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractLet Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set o...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
AbstractWe prove the inequality Σn≥7 (n−6) pn≤v−12 for any 3-dimensional polytope with v vertices an...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional...
Steinitz's theorem states that a graph G is the edge-graph of a 3-dimensional convex polyhedron if a...
AbstractIt is shown that if three vertices of the graph G(l') of a convex 3-polytope P are chosen, t...
AbstractA 5-dimensional convex polytope P is constructed whose graph G has the property that if it i...
Steinitz's theorem states that a graph $G$ is the edge-graph of a $3$-dimensional convex polyhedron...
AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary o...
AbstractRelations between graph theory and polyhedra are presented in two contexts. In the first, th...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractLet Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set o...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
AbstractWe prove the inequality Σn≥7 (n−6) pn≤v−12 for any 3-dimensional polytope with v vertices an...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
DOI
Add to ORKG