On the public citation graph

Disjoint edges in geometric graphs

https://doi.org/10.1007/bf02187731
0 signed · 40 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1080/00029890.1970.11992573openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22429.xopenalex-snapshot
Disjoint Simplices and Geometric Hypergraphs
inferredcites →https://doi.org/10.2307/2305092openalex-snapshot
On Sets of Distances of n Points

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1006/eujc.1996.0032openalex-snapshot
Forcing Disjoint Segments in the Plane
inferred← citeshttps://doi.org/10.1006/jagm.1999.1049openalex-snapshot
On Crossing Sets, Disjoint Sets, and Pagenumber
inferred← citeshttps://doi.org/10.1006/jcta.1999.3001openalex-snapshot
Note on Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_6openalex-snapshot
Crossing Numbers of Beyond-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_7openalex-snapshot
Nonplanar Graph Drawings with k Vertices per Face
inferred← citeshttps://doi.org/10.1007/978-3-540-30540-8_15openalex-snapshot
Disjoint Edges in Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_12openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_24openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_29openalex-snapshot
Choosing Colors for Geometric Graphs Via Color Space Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_17openalex-snapshot
The Beginnings of Geometric Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/bf01215345openalex-snapshot
Crossing families
inferred← citeshttps://doi.org/10.1007/bf02086610openalex-snapshot
Applications of the crossing number
inferred← citeshttps://doi.org/10.1007/bf02574361openalex-snapshot
Some geometric applications of Dilworth’s theorem
inferred← citeshttps://doi.org/10.1007/pl00009482openalex-snapshot
Geometric Graphs with Few Disjoint Edges
inferred← citeshttps://doi.org/10.1007/s00373-016-1719-6openalex-snapshot
On Convex Geometric Graphs with no $$k+1$$ k + 1 Pairwise Disjoint Edges
inferred← citeshttps://doi.org/10.1007/s00373-022-02563-2openalex-snapshot
Disjoint Edges in Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s00454-005-1191-1openalex-snapshot
Geometric Graphs with No Three Disjoint Edges
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00124-xopenalex-snapshot
Intersection number of two connected geometric graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90003-gopenalex-snapshot
A turán-type theorem on chords of a convex polygon
inferred← citeshttps://doi.org/10.1109/access.2024.3401078openalex-snapshot
Graphs Drawn With Some Vertices per Face: Density and Relationships
inferred← citeshttps://doi.org/10.1145/109648.109687openalex-snapshot
Crossing families
inferred← citeshttps://doi.org/10.1145/160985.161146openalex-snapshot
Some geometric applications of Dilworth's theorem
inferred← citeshttps://doi.org/10.1145/1653771.1653778openalex-snapshot
Going off-road
inferred← citeshttps://doi.org/10.1145/177424.177629openalex-snapshot
Applications of the crossing number
inferred← citeshttps://doi.org/10.1145/3301281openalex-snapshot
A Survey on Graph Drawing Beyond Planarity
inferred← citeshttps://doi.org/10.1155/2014/731519openalex-snapshot
Noncrossing Monochromatic Subtrees and Staircases in 0-1 Matrices
inferred← citeshttps://doi.org/10.1587/transfun.e98.a.1212openalex-snapshot
On the Structure of Locally Outerplanar Graphs
inferred← citeshttps://doi.org/10.20382/jocg.v9i1a12openalex-snapshot
Thickness and Antithickness of Graphs
inferred← citeshttps://doi.org/10.22215/etd/2017-11741openalex-snapshot
Matchings in Geometric Graphs
inferred← citeshttps://doi.org/10.4310/joc.2010.v1.n3.a4openalex-snapshot
Disjoint edges in topological graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.2132openalex-snapshot
Packing Plane Perfect Matchings into a Point Set
inferred← citeshttps://doi.org/10.46298/dmtcs.525openalex-snapshot
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0909.2891openalex-snapshot
Going Off-road: Transversal Complexity in Road Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1703.06526openalex-snapshot
On Optimal 2- and 3-Planar Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.