Rainbow Cycles in Flip Graphs.

DOI10.4230/LIPICS.SOCG.2018.38zbMath1489.68356OpenAlexW2963417543MaRDI QIDQ5115806

Linda Kleist, Stefan Felsner, Leon Sering, Torsten Mütze

Publication date: 18 August 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2018.38

zbMATH Keywords

rainbowtriangulationcyclematchingpermutationspanning treecombinationGray codeflip graphsubset

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Flip distances between graph orientations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flips in planar graphs
• Gray codes for non-crossing partitions and dissections of a convex polygon
• Gray codes with restricted density
• Balanced Gray codes
• Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
• Flipping edges in triangulations
• The associahedron and triangulations of the \(n\)-gon
• Graphs of non-crossing perfect matchings
• Graph of triangulations of a convex polygon and tree of triangulations
• Many non-equivalent realizations of the associahedron
• Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
• The diameter of associahedra
• Gray code enumeration of plane straight-line graphs
• Proof of the middle levels conjecture
• Happy endings for flip graphs
• Some Hamilton Paths and a Minimal Change Algorithm
• The rotation graph of binary trees is Hamiltonian
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Hamilton circuits with many colours in properly edge-coloured complete graphs.
• A Survey of Combinatorial Gray Codes
• A short proof of the middle levels theorem
• Adjacent interchange generation of combinations
• Rainbow Cycles in Flip Graphs
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Generation of Permutations by Adjacent Transposition

This page was built for publication: Rainbow Cycles in Flip Graphs.