Generating internally triconnected rooted plane graphs

DOI10.1007/978-3-642-13562-0_42MaRDI QIDQ3569099zbMATH OpenOpenAlexFDO

Authors Bingbing Zhuang, Hiroshi Nagamochi

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13562-0_42

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• Listing triconnected rooted plane graphs
• Efficient generation of triconnected plane triangulations.
• scientific article; zbMATH DE number 1796961
• Constant Time Generation of Biconnected Rooted Plane Graphs
• Generating rooted triangulations without repetitions

Cited in

(3)

• An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
• Constant Time Generation of Biconnected Rooted Plane Graphs
• Listing triconnected rooted plane graphs

This page was built for publication: Generating internally triconnected rooted plane graphs

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