Generating Nonisomorphic Maps without Storing Them

DOI10.1137/0604018zbMath0521.05034MaRDI QIDQ3671198

Timothy R. S. Walsh

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604018

zbMATH Keywords

rooted maps; orientable genus; nonisomorphic maps; testing for canonicity

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C30: Enumeration in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

Counting maps on doughnuts, Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices, An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps, Counting unrooted loopless planar maps, Enumeration of unrooted maps of a given genus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting non-isomorphic three-connected planar maps
• Counting rooted maps by genus. III: Nonseparable maps
• Simple perfect squared square of lowest order
• A V log V algorithm for isomorphism of triconnected planar graphs
• Counting rooted maps by genus. I
• Counting rooted maps by genus. II. Erratum
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Generating the Nine-Point Graphs
• On the enumeration of non-planar maps
• Depth-First Search and Linear Graph Algorithms
• A Census of Planar Maps