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

DOI10.1016/J.DAM.2008.06.018MaRDI QIDQ1028124zbMATH OpenOpenAlexWikidataFDO

Authors Clemens Huemer, Ferran Hurtado, Marc Noy, Elsa Omaña-Pulido

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) Eulerian and Hamiltonian graphs (05C45) Combinatorial codes (94B25)

Cites work

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

Cited in

(10)

• Gray code enumeration of plane straight-line graphs
• Gray codes, loopless algorithm and partitions
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• On flips in planar matchings
• Decompositions of a polygon into centrally symmetric pieces
• Gray codes for noncrossing and nonnesting partitions of classical types
• Flip distances between graph orientations
• Flips in planar graphs
• Rainbow cycles in flip graphs
• Rainbow cycles in flip 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)