Closed 2-cell embeddings of 4 cross-cap embeddable graphs

From MaRDI portal





A closed 2-cell embedding of a bridgeless graph \(G\) is an embedding of the graph in some surface such that each face is bounded by a circuit of the graph. A graph is called \(k\) cross-cap embeddable if the graph can be embedded in a surface with at most \(k\) cross-caps. In this paper, it is proved that every 2-connected 4 cross-cap embeddable graph has a 2-cell embedding in some surface. Consequently, the graph has a circuit double cover.











This page was built for publication: Closed 2-cell embeddings of 4 cross-cap embeddable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356673)