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.
Recommendations
Cites work
- Circular embedding of planar graphs in nonspherical surfaces
- Cycle covers of cubic multigraphs
- Face colorings of embedded graphs
- scientific article; zbMATH DE number 3937197 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3709228 (Why is no real title available?)
- scientific article; zbMATH DE number 16301 (Why is no real title available?)
- scientific article; zbMATH DE number 3636058 (Why is no real title available?)
- scientific article; zbMATH DE number 3639661 (Why is no real title available?)
- On embeddings of graphs containing noK5-minor
- Re-embedding of projective-planar graphs
- Relative Embeddings of Graphs on Closed Surfaces
- The closed 2-cell embeddings of 2-connected doubly toroidal graphs
Cited in
(7)- Closed 2-cell embeddings of 5-crosscap embeddable graphs
- Closed 2-cell embeddings in the projective plane
- Uniform strong 2-cell embeddings of bridgeless graphs
- The closed 2-cell embeddings of 2-connected doubly toroidal graphs
- Extended graph rotation systems as a model for cyclic weaving on orientable surfaces
- scientific article; zbMATH DE number 475602 (Why is no real title available?)
- Circuit double covers of graphs
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)