ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES
ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we characterize when G can be imbedded in a closed, connected pseudosurface with the given specifications. The specifications for the pseudosurface are: the number of face-connected components, the number of pinches, the number of crosscaps and handles, …