Gray codes for non-crossing partitions and dissections of a convex polygon

DOI10.1016/j.dam.2008.06.018zbMath1168.94519OpenAlexW1982177709WikidataQ61732487 ScholiaQ61732487MaRDI QIDQ1028124

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

zbMATH Keywords

Hamiltonian cycleGray codenon-crossing partitionpolygon dissection

Mathematics Subject Classification ID

Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Decompositions of a polygon into centrally symmetric pieces ⋮ Gray codes for noncrossing and nonnesting partitions of classical types ⋮ Gray code enumeration of plane straight-line graphs ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Flips in planar graphs ⋮ Rainbow Cycles in Flip Graphs ⋮ On flips in planar matchings ⋮ Flip distances between graph orientations ⋮ Rainbow Cycles in Flip Graphs.

Cites Work

• Unnamed Item
• A Gray code for set partitions
• Geometric tree graphs of points in convex position
• Analytic combinatorics of non-crossing configurations
• The associahedron and triangulations of the \(n\)-gon
• Antipodal Gray codes
• Gray code for derangements
• Graphs induced by Gray codes
• Bent Hamilton cycles in \(d\)-dimensional grid graphs
• Graphs of non-crossing perfect matchings
• Graph of triangulations of a convex polygon and tree of triangulations
• Noncrossing partitions
• Minimal change list for Lucas strings and some graph theoretic consequences
• The rotation graph of binary trees is Hamiltonian
• A Survey of Combinatorial Gray Codes
• Note on Gray codes for permutation lists
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Computing and Combinatorics

This page was built for publication: Gray codes for non-crossing partitions and dissections of a convex polygon