Generating Nonisomorphic Maps without Storing Them
From MaRDI portal
Cites work
- A Census of Planar Maps
- A V log V algorithm for isomorphism of triconnected planar graphs
- Counting non-isomorphic three-connected planar maps
- Counting rooted maps by genus. I
- Counting rooted maps by genus. II. Erratum
- Counting rooted maps by genus. III: Nonseparable maps
- Depth-First Search and Linear Graph Algorithms
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Generating the Nine-Point Graphs
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 3821780 (Why is no real title available?)
- scientific article; zbMATH DE number 3711416 (Why is no real title available?)
- scientific article; zbMATH DE number 3489159 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3338383 (Why is no real title available?)
- scientific article; zbMATH DE number 3390820 (Why is no real title available?)
- On the enumeration of non-planar maps
- Simple perfect squared square of lowest order
Cited in
(6)- Counting unrooted loopless planar maps
- Enumeration of unrooted maps of a given genus
- Counting maps on doughnuts
- Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
- Generating plane quadrangulations and symmetry-preserving operations on maps
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
This page was built for publication: Generating Nonisomorphic Maps without Storing Them
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671198)
