Details

Autor(en) / Beteiligte

• Liu, Jinsong
• Zhou, Ze

Titel

Intersection number and stability of some inscribable graphs

Ist Teil von

• Geometriae dedicata, 2016-12, Vol.185 (1), p.105-121

Ort / Verlag

Dordrecht: Springer Netherlands

Erscheinungsjahr

2016

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• A planar graph is inscribable if it is combinatorial equivalent to the skeleton of an inscribed polyhedron in the unit sphere S 2 . Giving an inscribable graph, in its combinatorial equivalent class if we could also find a polyhedron inscribed in each convex surface sufficiently close to the unit sphere S 2 , then we call such an inscribable graph a stable one. By combining the Teichmüller theory of packings with differential topology method, in this paper we shall investigate the stability of some inscribable graphs.