Intersection number and the stability of some inscribable graphs

Jinsong Liu, Ze Zhou

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 equiva…