2014/12/15 by Jinsong Liu, Ze Zhou, Liu, Jinsong +1
Computer Science · Mathematics · #51M10 #51M20 #52C26 #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Metric Geometry (math.MG)
paper · pdf · doi:10.48550/arxiv.1412.5670
openalex publication_date 2014/12/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in any given convex surface which is sufficiently close to the sphere, 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 there is investigation on the stability of some inscribable graphs.