Listing All Plane Graphs
DOI10.1007/978-3-540-77891-2_20zbMATH Open1132.05328OpenAlexW2106713240MaRDI QIDQ5452167FDOQ5452167
Authors: Katsuhisa Yamanaka, Shin-Ichi Nakano 
Publication date: 25 March 2008
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77891-2_20
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reverse search for enumeration
- How to draw a planar graph on a grid
- Title not available (Why is that?)
- Efficient Algorithms for Listing Combinatorial Structures
- Isomorph-Free Exhaustive Generation
- Minimum-width grid drawings of plane graphs
- Efficient generation of triconnected plane triangulations.
- Constant Time Generation of Rooted Trees
- Constant Time Generation of Free Trees
- Title not available (Why is that?)
Cited In (11)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four
- Listing All Plane Graphs
- Generating connected and 2-edge connected graphs
- Gray code enumeration of plane straight-line graphs
- Title not available (Why is that?)
- An Efficient Algorithm for Generating Colored Outerplanar Graphs
- Efficient generation of plane trees.
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Amortized efficiency of generating planar paths in convex position
- Listing triconnected rooted plane graphs
- Generating All Triangulations of Plane Graphs (Extended Abstract)
This page was built for publication: Listing All Plane Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452167)
