Rainbow Cycles in Flip Graphs

DOI10.1137/18M1216456zbMath1430.52009arXiv1712.07421WikidataQ126413675 ScholiaQ126413675MaRDI QIDQ5208641

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

Publication date: 9 January 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.07421

zbMATH Keywords

triangulationmatchingpermutationspanning treeGray coderainbow cycleflip graph

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) General convexity (52A99)

Related Items (2)

On flips in planar matchings ⋮ Rainbow Cycles in Flip Graphs.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph properties of graph associahedra
• 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
• The genus of curve, pants and flip graphs
• Once punctured disks, non-convex polygons, and pointihedra
• 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
• 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
• Edge Conflicts do not Determine Geodesics in the Associahedron
• A short proof of the middle levels theorem
• Adjacent interchange generation of combinations
• Eccentricities in the flip‐graphs of convex polygons
• 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