Note on inscribability of quadrangular polyhedra with restricted number of edge-types (Q1180135): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some problems on polyhedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5572939 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On quadrangular convex 3-polytopes with at most two types of edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5344765 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5528475 / rank | |||
Normal rank | |||
Latest revision as of 13:13, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on inscribability of quadrangular polyhedra with restricted number of edge-types |
scientific article |
Statements
Note on inscribability of quadrangular polyhedra with restricted number of edge-types (English)
0 references
27 June 1992
0 references
A polyhedron is called inscribable if it is combinatorially isomorphic to a polyhedron with all vertices on a sphere. The authors give a characterization of a special class of threedimensional quadrangular polyhedra which are inscribable.
0 references
inscribability of polyhedra
0 references
edge-types
0 references
Steinitz theorem
0 references
