Counting orientable embeddings by genus for a type of 3-regular graph

DOI10.1007/S00373-011-1029-YMaRDI QIDQ659758zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Associate polyhegonGenusGenus distributionJoint treeSurface

Mathematics Subject Classification ID

Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• Genus distributions of orientable embeddings for two types of graphs
• Genus embeddings of a type of graph
• On the number of genus embeddings of complete tripartite graph.
• Orientable embedding distributions by genus of crossing-digraph.
• On the number of genus embeddings of complete bipartite graphs

Cites work

• A genus inequality of the union graphs
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• Embedding digraphs on orientable surfaces
• Genus distribution of Ringel ladders
• Genus distributions for two classes of graphs
• Hierarchy for imbedding-distribution invariants of a graph
• On the embedding genus distribution of ladders and crosses
• On the genus distribution of (p,q,n)-dipoles
• Overlap matrices and total imbedding distributions
• The genus distributions of directed antiladders in orientable surfaces
• The graph genus problem is NP-complete
• Total embedding distributions for bouquets of circles

Cited in

(4)

• A new effective algorithm for the maximum genus of two types of 3-regular graphs
• Total genus distributions of two classes of \(4\)-regular graphs
• Genus distributions of orientable embeddings for two types of graphs
• Orientable embedding distributions by genus of crossing-digraph.

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)