On the public citation graph

Drawings of Graphs on Surfaces with Few Crossings

https://doi.org/10.1007/bf02086611

0 signed · 36 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.1002/jgt.3190020211openalex-snapshot

An infinite family of octahedral crossing numbers

inferredcites →https://doi.org/10.1002/jgt.3190020302openalex-snapshot

On stable crossing numbers

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.1006/aima.1996.0069openalex-snapshot

The Crossing Number of a Graph on a Compact 2-Manifold

inferredcites →https://doi.org/10.1007/bf01187020openalex-snapshot

Edge crossings in drawings of bipartite graphs

inferredcites →https://doi.org/10.1007/bf01759038openalex-snapshot

Multilayer grid embeddings for VLSI

inferredcites →https://doi.org/10.1007/bf01989746openalex-snapshot

On crossing numbers of hypercubes and cube connected cycles

inferredcites →https://doi.org/10.1016/0012-365x(89)90295-1openalex-snapshot

Selected topics in graph theory 3

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/0095-8956(78)90014-xopenalex-snapshot

The crossing number of C3 × Cn

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)80087-4openalex-snapshot

The crossing number of K

inferredcites →https://doi.org/10.1016/s0304-0208(08)73153-0openalex-snapshot

Cartesian Products of Graphs and Their Crossing Numbers

inferredcites →https://doi.org/10.1016/s0304-0208(08)x7063-xopenalex-snapshot

Graphs, Groups and Surfaces

inferredcites →https://doi.org/10.1017/s0963548300001383openalex-snapshot

On Canonical Concurrent Flows, Crossing Number and Graph Expansion

inferredcites →https://doi.org/10.1080/00029890.1973.11993230openalex-snapshot

Crossing Number Problems

inferredcites →https://doi.org/10.1109/sfcs.1993.366841openalex-snapshot

A simple local-control approximation algorithm for multicommodity flow

inferredcites →https://doi.org/10.1137/0604033openalex-snapshot

Crossing Number is NP-Complete

inferredcites →https://doi.org/10.1137/0804004openalex-snapshot

Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints

inferredcites →https://doi.org/10.1137/s0097539792241175openalex-snapshot

Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

inferredcites →https://doi.org/10.1145/103418.103425openalex-snapshot

Fast approximation algorithms for multicommodity flow problems

inferredcites →https://doi.org/10.1145/77600.77620openalex-snapshot

The maximum concurrent flow problem

inferredcites →https://doi.org/10.1201/9780203490204.ch7openalex-snapshot

Topological Graph Theory

inferredcites →https://doi.org/10.2307/1968030openalex-snapshot

Systems of Circuits on Two-Dimensional Manifolds

inferredcites →https://doi.org/10.2307/2318855openalex-snapshot

Graphs, Groups and Surfaces.

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-319-27261-0_8openalex-snapshot

Genus, Treewidth, and Local Crossing Number

inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_13openalex-snapshot

Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill

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/s00493-018-3733-1openalex-snapshot

Defective Colouring of Graphs Excluding A Subgraph or Minor

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.1137/16m1062879openalex-snapshot

Structure of Graphs with Locally Restricted Crossings

inferred← citeshttps://doi.org/10.1142/s0219265903000714openalex-snapshot

IMPROVED BOUNDS FOR THE CROSSING NUMBER OF THE MESH OF TREES

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.37236/728openalex-snapshot

The Minor Crossing Number of Graphs with an Excluded Minor

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.