Closed 2-cell embeddings of 5-crosscap embeddable graphs
The strong embedding conjecture states that every 2-connected graph has a closed 2-cell embedding in some surface, i.e. an embedding in a compact, closed 2-manifold in which the boundary of each face is a circuit in the graph. A graph is called 5-crosscap embeddable if it can be embedded in the surface of non-oriented genus 5. The main result of the paper states that any 2-connected graph which is 5-crosscap embeddable has a closed 2-cell embedding in some surface. As a corollary, it is shown that each such graph has a cycle double cover, i.e. a set of circuits in the graph such that each edge is contained in exactly two of these circuits.
- Closed 2-cell embeddings of 4 cross-cap embeddable graphs
- Maximum genus of strong embeddings
- Uniform strong 2-cell embeddings of bridgeless graphs
- The closed 2-cell embeddings of 2-connected doubly toroidal graphs
- Orientable embeddings and orientable cycle double covers of projective-planar graphs
- Cycle double covers and spanning minors. I
- scientific article; zbMATH DE number 640254 (Why is no real title available?)
- Circuit double covers of graphs
- Closed 2-cell embeddings of graphs with no V₈-minors
- A note on strong embeddings of maximal planar graphs on non-orientable surfaces
- Strong embeddings of minimum genus
- Strong embedding of HP-graphs on surface with higher genus
This page was built for publication: Closed 2-cell embeddings of 5-crosscap embeddable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357273)
