On the public citation graph

Latest results on crossing numbers

https://doi.org/10.1007/bfb0059432
0 signed · 53 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.1016/0095-8956(71)90045-1openalex-snapshot
An upper bound for the rectilinear crossing number of the complete graph
inferredcites →https://doi.org/10.1016/s0021-9800(67)80061-9openalex-snapshot
Two theorems on the minimum number of intersections for complete graphs
inferredcites →https://doi.org/10.1016/s0021-9800(68)80013-4openalex-snapshot
On a problem of P. Erdös
inferredcites →https://doi.org/10.1016/s0021-9800(68)80063-8openalex-snapshot
The toroidal crossing number of the complete graph
inferredcites →https://doi.org/10.1016/s0021-9800(69)80084-0openalex-snapshot
The toroidal crossing number of K
inferredcites →https://doi.org/10.1016/s0021-9800(70)80007-2openalex-snapshot
Toward a theory of crossing numbers
inferredcites →https://doi.org/10.1016/s0021-9800(70)80087-4openalex-snapshot
The crossing number of K
inferredcites →https://doi.org/10.1017/s0013091500025645openalex-snapshot
On the Number of Crossings in a Complete Graph
inferredcites →https://doi.org/10.1073/pnas.52.3.688openalex-snapshot
THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS
inferredcites →https://doi.org/10.1137/0113032openalex-snapshot
On the Distribution of Crossings in Random Complete Graphs
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
inferredcites →https://doi.org/10.2307/2306205openalex-snapshot
On a Problem of Erdos
inferredcites →https://doi.org/10.4064/fm-15-1-271-283openalex-snapshot
Sur le problème des courbes gauches en Topologie
inferredcites →https://doi.org/10.4064/fm-41-1-137-145openalex-snapshot
On a problem of P. Turan concerning graphs
inferredcites →https://doi.org/10.4153/cmb-1967-046-4openalex-snapshot
On the Möbius Ladders
inferredcites →https://doi.org/10.6028/jres.073b.018openalex-snapshot
Symmetry and the crossing number for complete graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.20330openalex-snapshot
An improved upper bound on the crossing number of the hypercube
inferred← citeshttps://doi.org/10.1002/jgt.22665openalex-snapshot
Drawings of complete graphs in the projective plane
inferred← citeshttps://doi.org/10.1002/jgt.22787openalex-snapshot
Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
inferred← citeshttps://doi.org/10.1002/jgt.3190120308openalex-snapshot
Cubic graphs with crossing number two
inferred← citeshttps://doi.org/10.1002/jgt.3190160502openalex-snapshot
New results on rectilinear crossing numbers and plane embeddings
inferred← citeshttps://doi.org/10.1002/jgt.3190170308openalex-snapshot
Bounds for rectilinear crossing numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_20openalex-snapshot
An Improved Upper Bound on the Crossing Number of the Hypercube
inferred← citeshttps://doi.org/10.1007/bf01085015openalex-snapshot
Graph theory
inferred← citeshttps://doi.org/10.1007/bfb0067363openalex-snapshot
Crossing numbers of graphs
inferred← citeshttps://doi.org/10.1007/bfb0071606openalex-snapshot
On crossing numbers and linguistic structures
inferred← citeshttps://doi.org/10.1007/s00373-007-0726-zopenalex-snapshot
On the Crossing Number of Km □ Pn
inferred← citeshttps://doi.org/10.1007/s00454-012-9403-yopenalex-snapshot
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n
inferred← citeshttps://doi.org/10.1007/s10114-014-3763-6openalex-snapshot
Drawing complete multipartite graphs on the plane with restrictions on crossings
inferred← citeshttps://doi.org/10.1007/s10114-022-2310-0openalex-snapshot
A Contribution to Guy’s Conjecture
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90041-6openalex-snapshot
Optimal crossing-free Hamiltonian circuit drawings of Kn
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90033-6openalex-snapshot
Grids and their minors
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90244-iopenalex-snapshot
Coloring drawings of bipartite graphs: A problem in automated assembly
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00010-hopenalex-snapshot
NETPAD: An interactive graphics system for network modeling and optimization
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50021-6openalex-snapshot
NETPAD: AN INTERACTIVE GRAPHICS SYSTEM FOR NETWORK MODELING AND OPTIMIZATION
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50007-5openalex-snapshot
10.1016/b978-044488002-4/50007-5
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.023openalex-snapshot
The crossing number of K1,m,n
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.045openalex-snapshot
The maximum number of halving lines and the rectilinear crossing number of for
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.06.002openalex-snapshot
On the crossing number of K13
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00314-6openalex-snapshot
Algorithms for the fixed linear crossing number problem
inferred← citeshttps://doi.org/10.1080/00029890.1973.11993230openalex-snapshot
Crossing Number Problems
inferred← citeshttps://doi.org/10.1080/09720529.1998.10697872openalex-snapshot
Quasi-total graphs with crossing numbers
inferred← citeshttps://doi.org/10.1080/09720529.2010.10698318openalex-snapshot
A criterion for (non-)planarity of the transformation graphGxyzwhenxyz= – + +
inferred← citeshttps://doi.org/10.1137/s0895480104442741openalex-snapshot
Improved Bounds for the Crossing Numbers of Km,n and Kn
inferred← citeshttps://doi.org/10.1177/027836499000900106openalex-snapshot
The Tethered Robot Problem
inferred← citeshttps://doi.org/10.21136/cpm.1982.118128openalex-snapshot
On the crossing numbers of $S_m \times P_n$ and $S_m \times C_n$
inferred← citeshttps://doi.org/10.3390/math9050525openalex-snapshot
An Improvement of the Lower Bound on the Minimum Number of ≤k-Edges
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.3836/tjm/1391177980openalex-snapshot
Counting Links and Knots in Complete Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1008.1085openalex-snapshot
Counting Links and Knots in Complete Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1902.02759openalex-snapshot
On Genus g Orientable Crossing Numbers of Small Complete Graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot
Planarizing Graphs - A Survey and Annotated Bibliography
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.