On the public citation graph
Intersections of curve systems and the crossing number ofC 5 ×C 5
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.
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.1002/jgt.3190040203openalex-snapshot
On the crossing numbers of products of cycles and graphs of order four
inferredcites →https://doi.org/10.1002/jgt.3190190113openalex-snapshot
The crossing number of c4 × c4
inferredcites →https://doi.org/10.1016/0095-8956(78)90014-xopenalex-snapshot
The crossing number of C3 × Cn
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0118(200011)35:3<222::aid-jgt7>3.0.co;2-eopenalex-snapshot
A lower bound for the crossing number ofCm � Cn
inferred← citeshttps://doi.org/10.1002/jgt.20016openalex-snapshot
The crossing number of C m × C n is as conjectured for n ≥ m ( m + 1)
inferred← citeshttps://doi.org/10.1002/jgt.20258openalex-snapshot
On the crossing numbers of Cartesian products with trees
inferred← citeshttps://doi.org/10.1002/jgt.20470openalex-snapshot
Infinite families of crossing‐critical graphs with prescribed average degree and crossing number
inferred← citeshttps://doi.org/10.1002/jgt.22613openalex-snapshot
Zip product of graphs and crossing numbers
inferred← citeshttps://doi.org/10.1006/jctb.1998.1858openalex-snapshot
On the Intersections of Systems of Curves
inferred← citeshttps://doi.org/10.1006/jctb.1998.1890openalex-snapshot
Drawings of Cm×Cn with One Disjoint Family
inferred← citeshttps://doi.org/10.1006/jctb.2000.2015openalex-snapshot
Drawings of Cm×Cn with One Disjoint Family II
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_8openalex-snapshot
Incidence and Arrangement Problems
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_9openalex-snapshot
Crossing-Critical Graphs and Path-Width
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_16openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_1openalex-snapshot
Crossings between Curves with Many Tangencies
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_6openalex-snapshot
Crossings Between Curves With Many Tangencies
inferred← citeshttps://doi.org/10.1007/s00373-007-0726-zopenalex-snapshot
On the Crossing Number of Km □ Pn
inferred← citeshttps://doi.org/10.1007/s00373-020-02133-4openalex-snapshot
Twenty Years of Progress of $$\hbox {JCDCG}^3$$
inferred← citeshttps://doi.org/10.1007/s00454-010-9245-4openalex-snapshot
General Lower Bounds for the Minor Crossing Number of Graphs
inferred← citeshttps://doi.org/10.1007/s00493-023-00041-8openalex-snapshot
The Number of Tangencies Between Two Families of Curves
inferred← citeshttps://doi.org/10.1016/j.aim.2018.03.015openalex-snapshot
A Crossing Lemma for Jordan curves
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.10.004openalex-snapshot
On the number of touching pairs in a set of planar curves
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.070openalex-snapshot
The crossing number of locally twisted cubes LTQn
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.077openalex-snapshot
The crossing numbers of products of 5-vertex graphs with cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2006.12.002openalex-snapshot
The crossing number of K1,4,n
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.ejc.2024.103929openalex-snapshot
On the number of tangencies among 1-intersecting x -monotone curves
inferred← citeshttps://doi.org/10.1016/j.jctb.2003.05.001openalex-snapshot
Arrangements, circular arrangements and the crossing number of C7×C
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00332-6openalex-snapshot
The crossing number of K2,3×C3
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00531-9openalex-snapshot
Small meshes of curves and their role in the analysis of optimal meshes
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00317-0openalex-snapshot
A successful concept for measuring non-planarity of graphs: the crossing number
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00026-1openalex-snapshot
Optimal meshes of curves in the Klein bottle
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00037-6openalex-snapshot
Crossing-number critical graphs have bounded path-width
inferred← citeshttps://doi.org/10.1017/s0004972719000091openalex-snapshot
ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH
inferred← citeshttps://doi.org/10.1017/s0963548316000043openalex-snapshot
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
inferred← citeshttps://doi.org/10.1080/00207160.2012.726711openalex-snapshot
An upper bound for the crossing number of augmented cubes
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.1145/1377676.1377739openalex-snapshot
Improved upper bounds on the crossing number
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4227openalex-snapshot
The crossing number of locally twisted cubes
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02200openalex-snapshot
Bounding a global red-blue proportion using local conditions
inferred← citeshttps://doi.org/10.48550/arxiv.1807.11617openalex-snapshot
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class
inferred← citeshttps://doi.org/10.48550/arxiv.1808.00385openalex-snapshot
A Note on the Maximum Rectilinear Crossing Number of Spiders
inferred← citeshttps://doi.org/10.48550/arxiv.1901.05155openalex-snapshot
A survey of graphs with known or bounded crossing numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1907.06245openalex-snapshot
A new bound for the crossing number of wrapped butterflies
inferred← citeshttps://doi.org/10.48550/arxiv.1911.07287openalex-snapshot
A Crossing Lemma for Families of Jordan Curves with a Bounded Intersection Number
inferred← citeshttps://doi.org/10.48550/arxiv.math/0009230openalex-snapshot
The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m
inferred← citeshttps://doi.org/10.48550/arxiv.math/0604467openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-001openalex-snapshot
On the number of tangencies among 1-intersecting curves
inferred← citeshttps://doi.org/10.7151/dmgt.1272openalex-snapshot
Some crossing numbers of products of cycles
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.