Counting non-isomorphic three-connected planar maps

DOI10.1016/0095-8956(82)90074-0zbMath0443.05050OpenAlexW1981498262MaRDI 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 mapsconnected planar maps

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (10)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Counting non-isomorphic three-connected planar maps