Efficient enumeration of sensed planar maps
From MaRDI portal
Publication:1779505
DOI10.1016/j.disc.2004.08.036zbMath1063.05070OpenAlexW1984327345MaRDI QIDQ1779505
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
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Counting unrooted maps on the plane, Counting maps on doughnuts, Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices, Enumeration of maps regardless of genus: geometric approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inversion of cycle index sum relations for 2- and 3-connected graphs
- D-finite power series
- Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps)
- Counting non-isomorphic three-connected planar maps
- Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
- Counting unrooted planar maps
- Hypermaps versus bipartite maps
- Counting rooted maps on an orientable surface of any genus by a function of the numbers of vertices and faces
- Counting unrooted loopless planar maps
- Enumeration of Eulerian and unicursal planar maps
- A reductive technique for enumerating non-isomorphic planar maps
- Enumeration of unrooted maps of a given genus
- Counting rooted maps by genus. II
- The Enumeration of Non-Isomorphic 2-Connected Planar Maps
- Theory of Maps on Orientable Surfaces
- On the Tumber of Planar Maps
- On the enumeration of planar maps
- The enumeration of c-nets via quadrangulations
- Enumeration of non-separable graphs
- A Census of Planar Maps
- On the Enumeration of Rooted Non-Separable Planar Maps
