The average genus for bouquets of circles and dipoles

DOI10.26493/1855-3974.2043.fbbzbMath1485.05039OpenAlexW3135214006MaRDI QIDQ3390048

Jinlian Zhang, Yi-Chao Chen, Xu-hui Peng

Publication date: 24 March 2022

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.2043.fbb

zbMATH Keywords

ordinary differential equationdipoleaverage genusbouquet of circles

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for the average genus of a CF-graph
• Region distributions of graph embeddings and Stirling numbers
• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• Kuratowski-type theorems for average genus
• Every connected regular graph of even degree is a Schreier coset graph
• Generating all graph coverings by permutation voltage assignments
• Genus distributions for bouquets of circles
• Total embedding distributions for bouquets of circles
• Bounds for the average genus of the vertex-amalgamation of graphs
• On the average genus of a graph
• Hierarchy for imbedding-distribution invariants of a graph
• A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus
• An Introduction to Random Topological Graph Theory
• Lower bounds for the average genus

This page was built for publication: The average genus for bouquets of circles and dipoles