Uniform strong 2-cell embeddings of bridgeless graphs
By a strong 2-cell embedding of a graph \(G\) is meant an open 2-cell embedding of \(G\) in which the image of every edge of \(G\) is incident with exact two faces of the embedding. An embedding is said to be uniform if the boundary of each face contains the same number of edges. If the number is specified to be \(k\) in a uniform embedding, then the embedding is called a \(k\)-pattern. In this paper, the authors illustrate the existence of \(k\)-patterns for all values of \(k\geq 3\) and all possible numbers of faces on the sphere, the projective plane, the torus and the Klein bottle. Then, they also show some sharp characterizations of uniform embeddings as \(k\)-patterns based on the number of edges on each face boundary.
- Clean triangulations
- Genus of cartesian products of regular bipartite graphs
- scientific article; zbMATH DE number 3691366 (Why is no real title available?)
- scientific article; zbMATH DE number 3588683 (Why is no real title available?)
- scientific article; zbMATH DE number 1145904 (Why is no real title available?)
- Minimal quadrangulations of orientable surfaces
- On the genus of finite abelian groups
- On the genus of five‐ and six‐regular graphs
- Quadrangular embeddings of the complete even k-partite graph
- Special embeddings of Cayley diagrams
- The Genus of Repeated Cartesian Products of Bipartite Graphs
- The genus of the Cartesian product of two graphs
This page was built for publication: Uniform strong 2-cell embeddings of bridgeless graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897438)