On the public citation graph
Crossing numbers of graphs
0 signed · 95 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/978-0-8176-4842-8_3openalex-snapshot
A Combinatorial Problem in Geometry
inferredcites →https://doi.org/10.1007/bfb0059432openalex-snapshot
Latest results on crossing numbers
inferredcites →https://doi.org/10.1016/0012-365x(73)90127-1openalex-snapshot
The crossing number of the complement of a circuit
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/0095-8956(72)90042-1openalex-snapshot
A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d)
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.1080/00029890.1973.11993230openalex-snapshot
Crossing Number Problems
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0306028-7openalex-snapshot
On the Stable Crossing Number of Cubes
inferredcites →https://doi.org/10.1137/0113032openalex-snapshot
On the Distribution of Crossings in Random Complete Graphs
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
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.21908openalex-snapshot
On the Crossing Number of Kn without Computer Assistance
inferred← citeshttps://doi.org/10.1002/jgt.22613openalex-snapshot
Zip product of graphs and crossing numbers
inferred← citeshttps://doi.org/10.1002/jgt.22665openalex-snapshot
Drawings of complete graphs in the projective plane
inferred← citeshttps://doi.org/10.1002/jgt.22763openalex-snapshot
Bounding the tripartite‐circle crossing number of complete tripartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190120302openalex-snapshot
On the parity of crossing numbers
inferred← citeshttps://doi.org/10.1002/jgt.3190120306openalex-snapshot
Rectilinear drawings of graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190150109openalex-snapshot
Bounds for the crossing number of the N ‐cube
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/11764298_28openalex-snapshot
Experiments on Exact Crossing Minimization Using Column Generation
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_2openalex-snapshot
The Rectilinear Crossing Number of K n : Closing in (or Are We?)
inferred← citeshttps://doi.org/10.1007/978-3-032-00281-5_23openalex-snapshot
Weights of Convex Quadrilaterals and Empty Triangles in Weighted Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_12openalex-snapshot
Expected Crossing Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-31956-6_99openalex-snapshot
New Layouts for Multi-stage Interconnection Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_21openalex-snapshot
The Crossing Number of Graphs: Theory and Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-25462-8_40openalex-snapshot
On the Crossing Number of Generalized Fat Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-45567-4_24openalex-snapshot
Plane Constructions for Graphs, Networks, and Maps Measurements of Planarity
inferred← citeshttps://doi.org/10.1007/bfb0066436openalex-snapshot
Some recent results in topological graph theory
inferred← citeshttps://doi.org/10.1007/s00373-023-02711-2openalex-snapshot
Maximum Rectilinear Crossing Number of Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00454-007-1325-8openalex-snapshot
New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn
inferred← citeshttps://doi.org/10.1007/s00454-014-9644-zopenalex-snapshot
Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n
inferred← citeshttps://doi.org/10.1007/s00454-022-00408-6openalex-snapshot
Topological Drawings Meet Classical Theorems from Convex Geometry
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90035-5openalex-snapshot
Edges without crossings in drawings of complete graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90014-xopenalex-snapshot
The crossing number of C3 × Cn
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/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.011openalex-snapshot
The crossing number of the Cartesian product of paths with complete graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.05.006openalex-snapshot
A branch-and-cut approach to the crossing number problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.010openalex-snapshot
New results on lower bounds for the number of (≤k) -facets
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.015openalex-snapshot
Recent Advances in Exact Crossing Minimization (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00491-0openalex-snapshot
Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73153-0openalex-snapshot
Cartesian Products of Graphs and Their Crossing Numbers
inferred← citeshttps://doi.org/10.1017/s0963548397002976openalex-snapshot
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
inferred← citeshttps://doi.org/10.1080/0025570x.1998.11996675openalex-snapshot
The Crossing Number of Cm X Cn: A Reluctant Induction
inferred← citeshttps://doi.org/10.1080/07468342.1989.11973232openalex-snapshot
Are Graphs Finally Surfacing?
inferred← citeshttps://doi.org/10.1080/09720529.2006.10698101openalex-snapshot
Enumerations of the maximum rectilinear crossing numbers of complete and complete multi-partite graphs
inferred← citeshttps://doi.org/10.1080/1726037x.2021.1909219openalex-snapshot
On Numerical Invariant of Graph
inferred← citeshttps://doi.org/10.1080/17517575.2018.1552993openalex-snapshot
Expressing multiagent coalition structure problems for optimisation by quantum annealing
inferred← citeshttps://doi.org/10.1109/72.485670openalex-snapshot
A neural-network algorithm for a graph layout problem
inferred← citeshttps://doi.org/10.1109/tnn.2006.881486openalex-snapshot
An Improved Neural Network Model for the Two-Page Crossing Number Problem
inferred← citeshttps://doi.org/10.1137/17m1137231openalex-snapshot
Deciding Parity of Graph Crossing Number
inferred← citeshttps://doi.org/10.1142/s0218216518430101openalex-snapshot
A note on the cross-index of a complete graph based on a linear tree
inferred← citeshttps://doi.org/10.1145/1498698.1564504openalex-snapshot
Experiments on exact crossing minimization using column generation
inferred← citeshttps://doi.org/10.1145/3544979.3544987openalex-snapshot
The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing Number
inferred← citeshttps://doi.org/10.1155/2009/154015openalex-snapshot
An Evolutionary Formulation of the Crossing Number Problem
inferred← citeshttps://doi.org/10.11650/tjm/251003openalex-snapshot
A New Infinite Family of $4$-regular Crossing-critical Graphs
inferred← citeshttps://doi.org/10.18297/etd/647openalex-snapshot
Planar graphs : a historical perspective.
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.26493/1855-3974.2134.ac9openalex-snapshot
Convex drawings of the complete graph: topology meets geometry
inferred← citeshttps://doi.org/10.3329/jsr.v5i2.11019openalex-snapshot
Semi-Image Neighborhood Block Graphs with Crossing Numbers
inferred← citeshttps://doi.org/10.3390/axioms13070427openalex-snapshot
From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn
inferred← citeshttps://doi.org/10.3390/math10121998openalex-snapshot
Parity Properties of Configurations
inferred← citeshttps://doi.org/10.35799/jis.11.2.2011.182openalex-snapshot
KONSTRUKSI FAMILI GRAF HAMPIR PLANAR DENGAN ANGKA PERPOTONGAN TERTENTU
inferred← citeshttps://doi.org/10.37236/1567openalex-snapshot
The Rectilinear Crossing Number of $K_{10}$ is $62$
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.37236/3396openalex-snapshot
Remarks on a Conjecture of Barát and Tóth
inferred← citeshttps://doi.org/10.48550/arxiv.1811.08071openalex-snapshot
Midrange crossing constants for graphs classes
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.5120/6356-8782openalex-snapshot
Crossing Number of Join of Triangular Snake with mK1, Path and Cycle
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.