Counting non-isomorphic three-connected planar maps

DOI10.1016/0095-8956(82)90074-0MaRDI QIDQ1144046zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3489159 (Why is no real title available?)
• scientific article; zbMATH DE number 3205162 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A Census of Planar Maps
• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• Counting rooted maps by genus. III: Nonseparable maps
• Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
• Counting unrooted planar maps
• Enumeration of non-separable graphs
• Enumeration of nonisomorphic planar maps
• On the enumeration of non-planar maps

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144046)