Gray code enumeration of plane straight-line graphs
From MaRDI portal
Publication:2464050
DOI10.1007/S00373-007-0750-ZzbMATH Open1134.05035OpenAlexW2114101336WikidataQ61732491 ScholiaQ61732491MaRDI QIDQ2464050FDOQ2464050
Authors: Clemens Huemer, Birgit Vogtenhuber, Oswin Aichholzer, Franz Aurenhammer 
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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cites Work
- On the number of arrangements of pseudolines
- Flipping edges in triangulations
- Geometric tree graphs of points in convex position
- Reverse search for enumeration
- Crossing-Free Subgraphs
- Title not available (Why is that?)
- A Survey of Combinatorial Gray Codes
- Gray codes for non-crossing partitions and dissections of a convex polygon
- Enumerating order types for small point sets with applications
- Enumerating pseudo-triangulations in the plane
- Graphs of non-crossing perfect matchings
- Graph of triangulations of a convex polygon and tree of triangulations
- 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
Cited In (15)
- Gray code enumeration of families of integer partitions
- Pivot Gray codes for the spanning trees of a graph ft. the fan
- On flips in planar matchings
- Non-crossing Hamiltonian paths and cycles in output-polynomial time
- Enumerating constrained non-crossing minimally rigid frameworks
- On numbers of pseudo-triangulations
- Counting triangulations and other crossing-free structures via onion layers
- Rainbow cycles in flip graphs
- Rainbow cycles in flip graphs
- Gray coding cubic planar maps
- Amortized efficiency of generating planar paths in convex position
- Fast enumeration algorithms for non-crossing geometric graphs
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- Flip distances between graph orientations
- Flips in planar graphs
This page was built for publication: Gray code enumeration of plane straight-line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464050)
