Enumerative properties of rooted circuit maps

DOI10.1007/s00373-010-0937-6zbMath1230.05161OpenAlexW2123754314MaRDI QIDQ604989

Han Ren, Zhi-Cheng Gao

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0937-6

zbMATH Keywords

enumerationrooted mapcircuit graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• 3-trees with few vertices of degree 3 in circuit graphs
• A survey of the asymptotic behaviour of maps
• Face sizes of 3-polytopes
• Submaps of maps. I: General 0-1 laws
• 2-connected spanning subgraphs of planar 3-connected graphs
• 2-walks in circuit graphs
• Convex programming and circumference of 3-connected graphs of low genus
• Long cycles in 3-connected graphs
• Almost all maps are asymmetric
• Singularity Analysis of Generating Functions
• Asymptotic Methods in Enumeration
• 2‐connected coverings of bounded degree in 3‐connected graphs
• Trees in Polyhedral Graphs
• The enumeration of c-nets via quadrangulations
• On the Enumeration of Rooted Non-Separable Planar Maps