Gray code enumeration of plane straight-line graphs

DOI10.1007/S00373-007-0750-ZMaRDI QIDQ2464050zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

enumeration schemeGeometric graphsGray codes

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• Gray coding cubic planar maps
• Gray code enumeration of families of integer partitions
• A Survey of Combinatorial Gray Codes
• Listing All Plane Graphs
• Gray code numbers for graphs

Cites work

• A Survey of Combinatorial Gray Codes
• Crossing-Free Subgraphs
• Enumerating order types for small point sets with applications
• Enumerating pseudo-triangulations in the plane
• Flipping edges in triangulations
• Geometric tree graphs of points in convex position
• Graph of triangulations of a convex polygon and tree of triangulations
• Graphs of non-crossing perfect matchings
• Gray codes for non-crossing partitions and dissections of a convex polygon
• Hamilton cycles in the path graph of a set of points in convex position
• scientific article; zbMATH DE number 1354135 (Why is no real title available?)
• On the number of arrangements of pseudolines
• Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
• Reverse search for enumeration
• Sequences of spanning trees and a fixed tree theorem

Cited in

(15)

• Gray code enumeration of families of integer partitions
• 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
• Fast enumeration algorithms for non-crossing geometric graphs
• On flips in planar matchings
• Flip distances between graph orientations
• Amortized efficiency of generating planar paths in convex position
• Pivot Gray codes for the spanning trees of a graph ft. the fan
• Non-crossing Hamiltonian paths and cycles in output-polynomial time
• Gray coding cubic planar maps
• Enumerating constrained non-crossing minimally rigid frameworks
• Flips in planar graphs
• Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees

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)