A convexity problem in 3-polytopal graphs (Q793056)

In this paper, we prove that if \(\Gamma\) is a 3-polytopal graph such that every proper convex subgraph of \(\Gamma\) is a face of \(\Gamma\) and conversely, then \(\Gamma\) is either the graph of a tetrahedron, the graph of a triangular prism, the graph of a cube or the graph of a k-gonal bipyramid (\(k\geq 4)\).