Efficient enumeration of sensed planar maps

DOI10.1016/J.DISC.2004.08.036MaRDI QIDQ1779505zbMATH OpenOpenAlexFDO

Authors Timothy R. S. Walsh

Publication date 1 June 2005

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.08.036

zbMATH Keywords

exact enumerationefficient algorithmsquotient mapsunrooted planar maps

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• A reductive technique for enumerating non-isomorphic planar maps
• Enumerative formulae for unrooted planar maps: a pattern
• Counting unrooted maps on the plane
• scientific article; zbMATH DE number 3871396
• Enumerating rooted simple planar maps

Cites work

• scientific article; zbMATH DE number 3880743 (Why is no real title available?)
• scientific article; zbMATH DE number 3821780 (Why is no real title available?)
• scientific article; zbMATH DE number 3924814 (Why is no real title available?)
• scientific article; zbMATH DE number 4055646 (Why is no real title available?)
• scientific article; zbMATH DE number 3478130 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A Census of Planar Maps
• A reductive technique for enumerating non-isomorphic planar maps
• Counting non-isomorphic three-connected planar maps
• Counting rooted maps by genus. II
• Counting rooted maps on an orientable surface of any genus by a function of the numbers of vertices and faces
• Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
• Counting unrooted loopless planar maps
• Counting unrooted planar maps
• D-finite power series
• Enumeration of Eulerian and unicursal planar maps
• Enumeration of non-separable graphs
• Enumeration of unrooted maps of a given genus
• Hypermaps versus bipartite maps
• Inversion of cycle index sum relations for 2- and 3-connected graphs
• On the Enumeration of Rooted Non-Separable Planar Maps
• On the Tumber of Planar Maps
• On the enumeration of planar maps
• Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps)
• The Enumeration of Non-Isomorphic 2-Connected Planar Maps
• The enumeration of c-nets via quadrangulations
• Theory of Maps on Orientable Surfaces

Cited in

(7)

• Enumeration of maps regardless of genus: geometric approach
• Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
• Counting edge-transitive, one-ended, three-connected planar maps with a given growth rate.
• Counting unrooted maps using tree-decomposition
• Counting maps on doughnuts
• Counting unrooted maps on the plane
• scientific article; zbMATH DE number 4055646 (Why is no real title available?)

This page was built for publication: Efficient enumeration of sensed planar maps

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