Graphs of non-crossing perfect matchings
From MaRDI portal
Publication:1865140
DOI10.1007/s003730200038zbMath1009.05110OpenAlexW564413792MaRDI QIDQ1865140
Marc Noy, Carmen Hernando, Ferran Hurtado
Publication date: 25 March 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200038
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items
On planar path transformation, Disjoint compatibility via graph classes, Flipping plane spanning paths, On the flip graphs on perfect matchings of complete graphs and signed reversal graphs, The absolute order of a permutation representation of a Coxeter group, Kauffman's clock lattice as a graph of perfect matchings: a formula for its height, Notes on the Twisted Graph, Fast enumeration algorithms for non-crossing geometric graphs, Gray code enumeration of plane straight-line graphs, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, Disjoint compatibility graph of non-crossing matchings of points in convex position, Unnamed Item, Rainbow Cycles in Flip Graphs, On flips in planar matchings, Flip distances between graph orientations, Gray codes for non-crossing partitions and dissections of a convex polygon, Transforming spanning trees: A lower bound, Rainbow Cycles in Flip Graphs., Graphs of triangulations and perfect matchings, On local transformation of polygons with visibility properties.
