On the public citation graph

A polyhedral theory on graphs

https://doi.org/10.1007/bf02580420
0 signed · 17 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.1007/bf02401740openalex-snapshot
Über kombinatorische Topologie
inferredcites →https://doi.org/10.1016/s0167-5060(08)70508-9openalex-snapshot
On the Principal Edge Tripartition of a Graph
inferredcites →https://doi.org/10.1090/s0002-9947-1932-1501641-2openalex-snapshot
Non-separable and planar graphs
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0217789-3openalex-snapshot
A Characterization of the Double Point Structure of the Projection of a Polygonal Knot in Regular Position
inferredcites →https://doi.org/10.1215/s0012-7094-37-00336-3openalex-snapshot
A structural characterization of planar combinatorial graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1006/eujc.2001.0533openalex-snapshot
Enumeration of 2 -connected Loopless 4 -regular Maps on the Plane
inferred← citeshttps://doi.org/10.1006/jctb.2000.2030openalex-snapshot
4-Regular Maps on the Klein Bottle
inferred← citeshttps://doi.org/10.1006/jctb.2001.2064openalex-snapshot
The Number of Loopless 4-Regular Maps on the Projective Plane
inferred← citeshttps://doi.org/10.1007/bf02274063openalex-snapshot
Combinatorial invariants on planar graphs
inferred← citeshttps://doi.org/10.1007/bf02664795openalex-snapshot
Transportation networks: Old and new
inferred← citeshttps://doi.org/10.1007/s00373-021-02291-zopenalex-snapshot
Distributions of Near-4-Regular Maps on the Sphere and the Projective Plane
inferred← citeshttps://doi.org/10.1007/s10255-017-0706-xopenalex-snapshot
Counting rooted 4-regular unicursal planar maps
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00251-1openalex-snapshot
Enumerating near-4-regular maps on the sphere and the torus
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00013-9openalex-snapshot
Generalized bicycles
inferred← citeshttps://doi.org/10.26493/1855-3974.1615.979openalex-snapshot
4-edge-connected 4-regular maps on the projective plane
inferred← citeshttps://doi.org/10.37236/4038openalex-snapshot
Counting 2-Connected 4-Regular Maps on the Projective Plane
inferred← citeshttps://doi.org/10.48550/arxiv.0909.0104openalex-snapshot
Graphs as rotations
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.