AbstractLet Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set of proper convex subgraphs of Γ is equal to the set of proper convex subgraphs of the dodecahedron (resp. icosahedron), then Γ is isomorphic to the dodecahedron (resp. icosahedron)
AbstractThe convex hull ψn,n of certain (n!)2 tensors was considered recently in connection with gra...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Guibas conjectured that given a convex polygon P in the xy-plane along with two triangulations of i...
Let Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set of proper...
AbstractLet Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set o...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
Graphs and AlgorithmsA set C of vertices of a graph G is P(3)-convex if v is an element of C for eve...
AbstractA 5-dimensional convex polytope P is constructed whose graph G has the property that if it i...
AbstractA characterization theorem is given for 3-dimensional convex polytopes Q having the followin...
Let Kn be the complete undirected graph with n vertices. A 3-cycle is a cycle consisting of 3 edges....
Let Kn be the complete undirected graph with n vertices. A 3-cycle is a cycle consisting of 3 edges....
AbstractWe show that if G is a connected graph with the same proper convex subgraphs as (Kn)r, the C...
A polyhedron (3-dimensional polytope) is defined as a tessellation polyhedron if it possesses a net ...
AbstractWe present a necessary and sufficient condition for the union of a finite number of convex p...
AbstractThe convex hull ψn,n of certain (n!)2 tensors was considered recently in connection with gra...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Guibas conjectured that given a convex polygon P in the xy-plane along with two triangulations of i...
Let Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set of proper...
AbstractLet Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set o...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
This is a survey on methods to construct a three-dimensional convex polytope with a given combinator...
Graphs and AlgorithmsA set C of vertices of a graph G is P(3)-convex if v is an element of C for eve...
AbstractA 5-dimensional convex polytope P is constructed whose graph G has the property that if it i...
AbstractA characterization theorem is given for 3-dimensional convex polytopes Q having the followin...
Let Kn be the complete undirected graph with n vertices. A 3-cycle is a cycle consisting of 3 edges....
Let Kn be the complete undirected graph with n vertices. A 3-cycle is a cycle consisting of 3 edges....
AbstractWe show that if G is a connected graph with the same proper convex subgraphs as (Kn)r, the C...
A polyhedron (3-dimensional polytope) is defined as a tessellation polyhedron if it possesses a net ...
AbstractWe present a necessary and sufficient condition for the union of a finite number of convex p...
AbstractThe convex hull ψn,n of certain (n!)2 tensors was considered recently in connection with gra...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Guibas conjectured that given a convex polygon P in the xy-plane along with two triangulations of i...
DOI
Add to ORKG