Disjoint compatible geometric matchings
type: Item
instance of: scholarly article
title: Disjoint compatible geometric matchings
zbMATH Open document ID: 1260.05120
author: Mashhood Ishaque
author: Diane L. Souvaine
author: Csaba D. Tóth
published in: Discrete \& Computational Geometry
publication date: 2013-03-18T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6146012
MaRDI profile type: Publication
full work available at URL: s00454-012-9466-9
OpenAlex ID: W1972701463
cites work: Compatible geometric matchings
cites work: Convex partitions with 2-edge connected dual graphs
cites work: Constrained Tri-Connected Planar Straight Line Graphs
cites work: Every set of disjoint line segments admits a binary tree
cites work: On the Number of Cycles in Planar Graphs
cites work: Bases-cobases graphs and polytopes of matroids
cites work: Edge‐disjoint spanning trees: A connectedness theorem
cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\)
cites work: Pointed binary encompassing trees: simple and optimal
cites work: Counting Plane Graphs: Flippability and Its Applications
cites work: Plane Geometric Graph Augmentation: A Generic Perspective
cites work: Q3395507
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Q3799261
cites work: On the Number of Crossing‐Free Matchings, Cycles, and Partitions
cites work: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
cites work: Q4547825
cites work: Illumination in the presence of opaque line segments in the plane
cites work: On the Problem of Decomposing a Graph into n Connected Factors
DOI: 10.1007/S00454-012-9466-9
description: scientific article; zbMATH DE number 6146012