Counting orientable embeddings by genus for a type of 3-regular graph
From MaRDI portal
Publication:659758
DOI10.1007/s00373-011-1029-yzbMath1234.05124MaRDI QIDQ659758
Yanpei Liu, Jianchu Zeng, Rong-xia Hao
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1029-y
05C31: Graph polynomials
05C30: Enumeration in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
Cites Work
- Unnamed Item
- On the genus distribution of \((p,q,n)\)-dipoles
- On the embedding genus distribution of ladders and crosses
- Genus distributions for two classes of graphs
- Overlap matrices and total imbedding distributions
- Genus distribution of Ringel ladders
- Total embedding distributions for bouquets of circles
- Embedding digraphs on orientable surfaces
- The genus distributions of directed antiladders in orientable surfaces
- The graph genus problem is NP-complete
- Hierarchy for imbedding-distribution invariants of a graph
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem