Generating unlabeled connected cubic planar graphs uniformly at random

DOI10.1002/rsa.20206zbMath1138.05067OpenAlexW4242296340MaRDI QIDQ5454357

Manuel Bodirsky, Clemens Gröpl, Mihyun Kang

Publication date: 28 March 2008

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20206

zbMATH Keywords

random samplingenumerative combinatoricsrandom planar structures

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Cubic graphs and related triangulations on orientable surfaces ⋮ Phase transitions in graphs on orientable surfaces ⋮ Generating and counting unlabeled \(k\)-path graphs

Cites Work

• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
• Enumeration of rooted cubic planar maps
• A Census of Planar Triangulations
• The Enumeration of Non-Isomorphic 2-Connected Planar Maps
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating unlabeled connected cubic planar graphs uniformly at random