On the public citation graph
Geometric Graphs with Few Disjoint Edges
0 signed · 25 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/eujc.1996.0032openalex-snapshot
Forcing Disjoint Segments in the Plane
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187731openalex-snapshot
Disjoint edges in geometric graphs
inferredcites →https://doi.org/10.1007/bf02574361openalex-snapshot
Some geometric applications of Dilworth’s theorem
inferredcites →https://doi.org/10.1007/bf02579761openalex-snapshot
Jahresbericht der Deutschen Mathematikervereinigung
inferredcites →https://doi.org/10.1007/pl00009364openalex-snapshot
On Geometric Graphs with No k Pairwise Parallel Edges
inferredcites →https://doi.org/10.1145/160985.161146openalex-snapshot
Some geometric applications of Dilworth's theorem
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/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/s003730200017openalex-snapshot
Ramsey-Type Results for Unions of Comparability Graphs
inferred← citeshttps://doi.org/10.1007/s11083-006-9043-zopenalex-snapshot
A Bipartite Analogue of Dilworth’s Theorem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.10.003openalex-snapshot
On the chromatic number of some geometric type Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.12.009openalex-snapshot
On the light side of geometric graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.04.006openalex-snapshot
Packing plane spanning trees and paths in complete geometric graphs
inferred← citeshttps://doi.org/10.13189/ms.2023.110303openalex-snapshot
Historical Review of Existing Sequences and the Representation of the Wing Sequence
inferred← citeshttps://doi.org/10.22215/etd/2017-11741openalex-snapshot
Matchings in Geometric 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.1405.4019openalex-snapshot
On Convex Geometric Graphs with no $k+1$ Pairwise Disjoint Edges
inferred← citeshttps://doi.org/10.48550/arxiv.1701.05286openalex-snapshot
Algorithms For Longest Chains In Pseudo- Transitive 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.