A convexity problem in 3-polytopal graphs (Q793056): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A convexity problem in 3-polytopal graphs |
scientific article |
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
