Gray code enumeration of plane straight-line graphs
From MaRDI portal
Publication:2464050
DOI10.1007/s00373-007-0750-zzbMath1134.05035OpenAlexW2114101336WikidataQ61732491 ScholiaQ61732491MaRDI QIDQ2464050
Birgit Vogtenhuber, Clemens Huemer, Franz Aurenhammer, Oswin Aichholzer
Publication date: 10 December 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0750-z
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
On numbers of pseudo-triangulations, Amortized efficiency of generating planar paths in convex position, Fast enumeration algorithms for non-crossing geometric graphs, Enumerating constrained non-crossing minimally rigid frameworks, Flips in planar graphs, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, Rainbow Cycles in Flip Graphs, On flips in planar matchings, Flip distances between graph orientations, Rainbow Cycles in Flip Graphs., Counting triangulations and other crossing-free structures via onion layers
Cites Work
- Unnamed Item
- Gray codes for non-crossing partitions and dissections of a convex polygon
- Geometric tree graphs of points in convex position
- On the number of arrangements of pseudolines
- Enumerating pseudo-triangulations in the plane
- Flipping edges in triangulations
- Enumerating order types for small point sets with applications
- Graphs of non-crossing perfect matchings
- Reverse search for enumeration
- Graph of triangulations of a convex polygon and tree of triangulations
- Crossing-Free Subgraphs
- A Survey of Combinatorial Gray Codes
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
- Hamilton cycles in the path graph of a set of points in convex position
- Sequences of spanning trees and a fixed tree theorem
