𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A convex characterization of the graphs of the dodecahedron and icosahedron

✍ Scribed by Patricia Vanden Cruyce

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
378 KB
Volume
50
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let r be a 3-polytopal graph such that every face of r is convex. We prove that if the set of proper convex subgraphs of r is equal to the set of proper convex subgraphs of the dodecahedron (resp. icosahedron), then F is isomorphic to the dodecahedron (resp. icosahedron).

πŸ“œ SIMILAR VOLUMES

Characterization of the cartesian produc
Characterization of the cartesian product of complete graphs by convex subgraphs
✍ Yoshimi Egawa πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 115 KB

We show that if G is a connected graph with the same proper convex subgraphs as (Kn)', the Cartesian product of r copies of Kn, r >t 2, n >t 3, then [V(G)I ~> n" with equality if and only if G is isomorphic to (Kn)'. In this note we consider only connected finite undirected simple graphs. The compl

The Geometry of Convex Affine Maximal Gr
The Geometry of Convex Affine Maximal Graphs
✍ Jose Antonio GΓ‘lvez; Antonio MartΓ­nez; Francisco MilΓ‘n πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 2 views
Complete subgraphs of the graphs of conv
Complete subgraphs of the graphs of convex polytopes
✍ S. Gallivan; E.R. Lockeberg; P. McMullen πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 631 KB

It is shown that if three vertices of the graph c?(l)) of a convex 3-polytope P are chosen, then G(P) contains a refinement of the complete graph C,, on four vertices, for which the three chosen vertices are principal (that is, correspond to vertices of C, in the refinement.. In general, all four ve