Enumerating reflexible 2-cell embeddings of connected graphs
From MaRDI portal
Publication:1955489
DOI10.1007/s11425-012-4544-2zbMath1266.05016OpenAlexW2260680114MaRDI QIDQ1955489
Jin-Xin Zhou, Yan Quan Feng, Jin Ho Kwok
Publication date: 11 June 2013
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-012-4544-2
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Related Items (1)
Uses Software
Cites Work
- Regular orientable imbeddings of complete graphs
- Genus distributions for two classes of graphs
- Genus distributions for bouquets of circles
- Enumeration of graph embeddings
- The Magma algebra system. I: The user language
- Genus distribution of Ringel ladders
- Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles
- Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs
- Enumerating 2-Cell Imbeddings of Connected Graphs
- Intrinsic Chirality of Complete Graphs
- Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Enumerating reflexible 2-cell embeddings of connected graphs