Counting orientable embeddings by genus for a type of 3-regular graph
From MaRDI portal
Publication:659758
DOI10.1007/S00373-011-1029-YzbMATH Open1234.05124OpenAlexW2005317331MaRDI QIDQ659758FDOQ659758
Authors: Jianchu Zeng, Yanpei Liu, 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
Recommendations
Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cites Work
- Embedding digraphs on orientable surfaces
- The graph genus problem is NP-complete
- Hierarchy for imbedding-distribution invariants of a graph
- 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
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- On the genus distribution of \((p,q,n)\)-dipoles
- On the embedding genus distribution of ladders and crosses
- The genus distributions of directed antiladders in orientable surfaces
- A genus inequality of the union graphs
Cited In (4)
This page was built for publication: Counting orientable embeddings by genus for a type of 3-regular graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659758)