Gray codes for non-crossing partitions and dissections of a convex polygon
DOI10.1016/J.DAM.2008.06.018zbMATH Open1168.94519OpenAlexW1982177709WikidataQ61732487 ScholiaQ61732487MaRDI QIDQ1028124FDOQ1028124
Clemens Huemer, Elsa Omaña-Pulido, Marc Noy, Ferran Hurtado
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.018
Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Combinatorial codes (94B25)
Cites Work
- Geometric tree graphs of points in convex position
- Analytic combinatorics of non-crossing configurations
- Noncrossing partitions
- The rotation graph of binary trees is Hamiltonian
- A Survey of Combinatorial Gray Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- The associahedron and triangulations of the \(n\)-gon
- A Gray code for set partitions
- Gray code for derangements
- Title not available (Why is that?)
- Graphs of non-crossing perfect matchings
- Graph of triangulations of a convex polygon and tree of triangulations
- Computing and Combinatorics
- Antipodal Gray codes
- Bent Hamilton cycles in \(d\)-dimensional grid graphs
- Graphs induced by Gray codes
- Minimal change list for Lucas strings and some graph theoretic consequences
- Note on Gray codes for permutation lists
Cited In (11)
- Gray code enumeration of plane straight-line graphs
- Gray codes, loopless algorithm and partitions
- Rainbow Cycles in Flip Graphs.
- Rainbow Cycles in Flip Graphs
- On flips in planar matchings
- Gray codes for noncrossing and nonnesting partitions of classical types
- Prefix partitioned Gray codes for particular cross-bifix-free sets
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Decompositions of a polygon into centrally symmetric pieces
- Flip distances between graph orientations
- Flips in planar graphs
This page was built for publication: Gray codes for non-crossing partitions and dissections of a convex polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028124)
