Bounding the number of embeddings of 5‐connected projective‐planar graphs
Shigeru Kitakubo · Journal of Graph Theory · 1991
Abstract A graph is said to be projective‐planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projectiveplanar embeddings (up to equivalence) of all 5‐connected graphs have an upper bound c(⩽120).