Disjoint compatible geometric matchings
From MaRDI portal
Publication:1942309
DOI10.1007/s00454-012-9466-9zbMath1260.05120OpenAlexW1972701463MaRDI QIDQ1942309
Diane L. Souvaine, Mashhood Ishaque, Csaba D. Tóth
Publication date: 18 March 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-012-9466-9
Related Items
On Compatible Matchings, Plane augmentation of plane graphs to meet parity constraints, Circumscribing polygons and polygonizations for disjoint line segments, Disjoint compatibility via graph classes, Compatible spanning trees in simple drawings of \(K_n\), Linear transformation distance for bichromatic matchings, Compatible spanning trees, On compatible matchings, Disjoint compatibility graph of non-crossing matchings of points in convex position, Unnamed Item, Transition operations over plane trees, Flip distance to some plane configurations, Flip Distance to some Plane Configurations., Augmenting Geometric Graphs with Matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex partitions with 2-edge connected dual graphs
- Bases-cobases graphs and polytopes of matroids
- Pointed binary encompassing trees: simple and optimal
- Compatible geometric matchings
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Counting Plane Graphs: Flippability and Its Applications
- Plane Geometric Graph Augmentation: A Generic Perspective
- Constrained Tri-Connected Planar Straight Line Graphs
- Counting plane graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- On the Number of Cycles in Planar Graphs
- Edge‐disjoint spanning trees: A connectedness theorem
- Every set of disjoint line segments admits a binary tree
- Illumination in the presence of opaque line segments in the plane
