Counting non-isomorphic three-connected planar maps

DOI10.1016/0095-8956(82)90074-0zbMath0443.05050MaRDI QIDQ1144046

Timothy R. S. Walsh

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90074-0

zbMATH Keywords

rooted planar maps; connected planar maps

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

Related Items

A survey of the asymptotic behaviour of maps, Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps), Counting rooted maps by genus. III: Nonseparable maps, Efficient enumeration of sensed planar maps, A method for cutting squares into distinct squares, Generating labeled planar graphs uniformly at random, Counting rooted maps by genus. I, Generating Nonisomorphic Maps without Storing Them

Cites Work

• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
• Counting unrooted planar maps
• Counting rooted maps by genus. III: Nonseparable maps
• Enumeration of nonisomorphic planar maps
• On the enumeration of non-planar maps
• Enumeration of non-separable graphs
• A Census of Planar Maps
• Unnamed Item
• Unnamed Item
• Unnamed Item