On the public citation graph
On Geometric Graphs with No k Pairwise Parallel Edges
0 signed · 73 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.1007/3-540-63938-1_63openalex-snapshot
Graph drawing with no k pairwise crossing edges
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/bf01302967openalex-snapshot
Generalized Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1007/bf02086610openalex-snapshot
Applications of the crossing number
inferredcites →https://doi.org/10.1007/bf02574361openalex-snapshot
Some geometric applications of Dilworth’s theorem
inferredcites →https://doi.org/10.1007/bfb0021784openalex-snapshot
Quasi-planar graphs have a linear number of edges
inferredcites →https://doi.org/10.1007/pl00009357openalex-snapshot
On Geometric Graphs with No Two Edges in Convex Position
inferredcites →https://doi.org/10.1007/s004539900039openalex-snapshot
Applications of the Crossing Number
inferredcites →https://doi.org/10.1016/0012-365x(92)90677-8openalex-snapshot
Generalized Davenport-Schinzel sequences with linear upper bound
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
inferredcites →https://doi.org/10.2307/2373068openalex-snapshot
A Combinatorial Problem Connected with Differential Equations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1999.1049openalex-snapshot
On Crossing Sets, Disjoint Sets, and Pagenumber
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_28openalex-snapshot
Geometric Graphs with No Self-intersecting Path of Length Three
inferred← citeshttps://doi.org/10.1007/3-540-47789-6_2openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_63openalex-snapshot
Graph drawing with no k pairwise crossing edges
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_16openalex-snapshot
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_26openalex-snapshot
Drawing Non-Planar Graphs with Crossing-Free Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_9openalex-snapshot
New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs
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-45078-8_12openalex-snapshot
Extremal Configurations and Levels in Pseudoline Arrangements
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-662-45803-7_16openalex-snapshot
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_5openalex-snapshot
Planar and Quasi Planar Simultaneous Geometric Embedding
inferred← citeshttps://doi.org/10.1007/pl00009357openalex-snapshot
On Geometric Graphs with No Two Edges in Convex Position
inferred← citeshttps://doi.org/10.1007/pl00009482openalex-snapshot
Geometric Graphs with Few Disjoint Edges
inferred← citeshttps://doi.org/10.1007/s00373-013-1335-7openalex-snapshot
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges
inferred← citeshttps://doi.org/10.1007/s00454-005-1191-1openalex-snapshot
Geometric Graphs with No Three Disjoint Edges
inferred← citeshttps://doi.org/10.1007/s00493-008-2250-zopenalex-snapshot
Geometric graphs with no two parallel edges
inferred← citeshttps://doi.org/10.1007/s00493-016-3414-xopenalex-snapshot
On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations
inferred← citeshttps://doi.org/10.1007/s00493-017-3792-8openalex-snapshot
On the Size of K-Cross-Free Families
inferred← citeshttps://doi.org/10.1007/s00493-025-00139-1openalex-snapshot
On the Number of Digons in Arrangements of Pairwise Intersecting Circles
inferred← citeshttps://doi.org/10.1007/s10474-009-9030-0openalex-snapshot
Ball polytopes and the Vázsonyi problem
inferred← citeshttps://doi.org/10.1007/s11856-010-0056-3openalex-snapshot
Turán-type results for partial orders and intersection graphs of convex sets
inferred← citeshttps://doi.org/10.1016/j.aim.2021.107779openalex-snapshot
Planar point sets determine many pairwise crossing segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.001openalex-snapshot
New bounds on the maximum number of edges in k-quasi-planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.07.002openalex-snapshot
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102123openalex-snapshot
A note on the k-colored crossing ratio of dense geometric 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.disc.2013.03.001openalex-snapshot
A note on light geometric graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.09.019openalex-snapshot
Geometric graphs with no self-intersecting path of length three
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.021openalex-snapshot
Coloring K k -free intersection graphs of geometric objects in the plane
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104212openalex-snapshot
1-planar unit distance graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.10.007openalex-snapshot
Linear algebra approach to geometric graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.08.006openalex-snapshot
A new proof of Vázsonyi's conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.006openalex-snapshot
Simple k-planar graphs are simple (k + 1)-quasiplanar
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.02.003openalex-snapshot
Extremal problems for pairs of triangles
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.020openalex-snapshot
Fan-planarity: Properties and complexity
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00255-6openalex-snapshot
Extremal problems for colored trees and Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1093/comjnl/bxad038openalex-snapshot
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth
inferred← citeshttps://doi.org/10.1093/comjnl/bxv048openalex-snapshot
Planar and Quasi-Planar Simultaneous Geometric Embedding
inferred← citeshttps://doi.org/10.1112/jlms.70324openalex-snapshot
Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications
inferred← citeshttps://doi.org/10.1137/110858586openalex-snapshot
The Number of Edges in $k$-Quasi-planar Graphs
inferred← citeshttps://doi.org/10.1137/17m1157374openalex-snapshot
Outerstring Graphs are $\chi$-Bounded
inferred← citeshttps://doi.org/10.1142/9789812773289_0003openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1145/1377676.1377735openalex-snapshot
Coloring k k -free intersection graphs of geometric objects in the plane
inferred← citeshttps://doi.org/10.1145/2582112.2582115openalex-snapshot
Outerstring graphs are χ-bounded
inferred← citeshttps://doi.org/10.1145/3301281openalex-snapshot
A Survey on Graph Drawing Beyond Planarity
inferred← citeshttps://doi.org/10.37236/12054openalex-snapshot
A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane
inferred← citeshttps://doi.org/10.37236/1512openalex-snapshot
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
inferred← citeshttps://doi.org/10.4230/lipics.gd.2024.9openalex-snapshot
On problems related to crossing families
inferred← citeshttps://doi.org/10.4310/joc.2010.v1.n3.a4openalex-snapshot
Disjoint edges in topological graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1112.2361openalex-snapshot
The number of edges in k-quasi-planar graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot
Planarizing Graphs - A Survey and Annotated Bibliography
inferred← citeshttps://doi.org/10.7155/jgaa.00080openalex-snapshot
Extreme Distances in Multicolored Point Sets
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.