Enumerative properties of rooted circuit maps

DOI10.1007/S00373-010-0937-6MaRDI QIDQ604989zbMATH OpenOpenAlexFDO

Authors Han Ren, Zhicheng 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

circuit graphenumerationrooted map

Mathematics Subject Classification ID

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

Recommendations

• The number of rooted circuit boundary maps
• Enumerating rooted loopless planar maps
• scientific article; zbMATH DE number 3878960
• Enumerating rooted simple planar maps
• The enumeration of general rooted planar maps
• Enumeration of rooted unicursal planar maps
• Enumeration of rooted vertex non-separable planar maps
• Enumerating rooted Eulerian planar maps
• Enumeration of rooted planar Halin maps
• Enumeration of multi-colored rooted maps

Cites work

• 2-connected spanning subgraphs of planar 3-connected graphs
• 2-walks in circuit graphs
• 2‐connected coverings of bounded degree in 3‐connected graphs
• 3-trees with few vertices of degree 3 in circuit graphs
• A survey of the asymptotic behaviour of maps
• Almost all maps are asymmetric
• Asymptotic Methods in Enumeration
• Convex programming and circumference of 3-connected graphs of low genus
• Face sizes of 3-polytopes
• scientific article; zbMATH DE number 4165039 (Why is no real title available?)
• scientific article; zbMATH DE number 786140 (Why is no real title available?)
• Long cycles in 3-connected graphs
• On the Enumeration of Rooted Non-Separable Planar Maps
• Singularity Analysis of Generating Functions
• Submaps of maps. I: General 0-1 laws
• The enumeration of c-nets via quadrangulations
• Trees in Polyhedral Graphs

This page was built for publication: Enumerative properties of rooted circuit maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604989)