On the Number of Crossing‐Free Matchings, Cycles, and Partitions
From MaRDI portal
Publication:3446814
DOI10.1137/050636036zbMath1120.68085WikidataQ54308783 ScholiaQ54308783MaRDI QIDQ3446814
Publication date: 26 June 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050636036
counting; crossing-free geometric graphs; crossing-free partitions; simple polygonizations; crossing-free matchings
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52C45: Combinatorial complexity of geometric structures
Related Items
Untangling planar graphs from a specified vertex position-Hard cases, Flips in planar graphs, On the number of plane geometric graphs, Counting Plane Graphs with Exponential Speed-Up