A convexity problem in 3-polytopal graphs (Q793056)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A convexity problem in 3-polytopal graphs |
scientific article; zbMATH DE number 3855161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convexity problem in 3-polytopal graphs |
scientific article; zbMATH DE number 3855161 |
Statements
A convexity problem in 3-polytopal graphs (English)
0 references
1984
0 references
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)\).
0 references
3-polytopal graph
0 references
convex subgraph
0 references
0.7754857540130615
0 references
0.7746816277503967
0 references
0.7704607844352722
0 references
