On the public citation graph
The Crossing Number of a Projective Graph is Quadratic in the Face–Width
0 signed · 21 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/(sici)1097-0118(199706)25:2<153::aid-jgt7>3.0.co;2-lopenalex-snapshot
Minimal embeddings in the projective plane
inferredcites →https://doi.org/10.1002/jgt.3190200305openalex-snapshot
Computing the orientable genus of projective graphs
inferredcites →https://doi.org/10.1006/jctb.1996.0016openalex-snapshot
Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings
inferredcites →https://doi.org/10.1007/11561071_14openalex-snapshot
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
inferredcites →https://doi.org/10.1007/11786986_37openalex-snapshot
Planar Crossing Numbers of Genus g Graphs
inferredcites →https://doi.org/10.1007/978-3-540-70904-6_16openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferredcites →https://doi.org/10.1137/s0097539700373520openalex-snapshot
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
inferredcites →https://doi.org/10.1137/s089548019529248xopenalex-snapshot
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
inferredcites →https://doi.org/10.1142/s0129054106004236openalex-snapshot
PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE
inferredcites →https://doi.org/10.37236/728openalex-snapshot
The Minor Crossing Number of Graphs with an Excluded Minor
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-030-04414-5_18openalex-snapshot
Crossing Numbers and Stress of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_11openalex-snapshot
A Tighter Insertion-Based Approximation of the Crossing Number
inferred← citeshttps://doi.org/10.1007/s00453-019-00653-xopenalex-snapshot
Crossing Number for Graphs with Bounded Pathwidth
inferred← citeshttps://doi.org/10.1007/s10878-016-0030-zopenalex-snapshot
A tighter insertion-based approximation of the crossing number
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.009openalex-snapshot
Vertex insertion approximates the crossing number of apex graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.05.009openalex-snapshot
Toroidal grid minors and stretch in embedded graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1403.1273openalex-snapshot
Toroidal grid minors and stretch in embedded graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1808.07558openalex-snapshot
Crossing Numbers and Stress of Random 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.