On the public citation graph

Upper and lower imbeddable graphs

https://doi.org/10.1007/bfb0067378
0 signed · 20 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/bf02993245openalex-snapshot
Das Geschlecht des vollständigen paaren Graphen
inferredcites →https://doi.org/10.1016/0095-8956(71)90036-0openalex-snapshot
On the maximum genus of a graph
inferredcites →https://doi.org/10.1016/0095-8956(72)90014-7openalex-snapshot
Determining AII compact orientable 2-manifolds upon which Km,n has 2-cell imbeddings
inferredcites →https://doi.org/10.1016/0095-8956(72)90040-8openalex-snapshot
A Kuratowski-type theorem for the maximum genus of a graph
inferredcites →https://doi.org/10.1017/s2040618500035097openalex-snapshot
Inequalities involving the genus of a graph and its thicknesses
inferredcites →https://doi.org/10.1073/pnas.60.2.438openalex-snapshot
SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
inferredcites →https://doi.org/10.1080/00029890.1971.11992770openalex-snapshot
How is a Graph's Betti Number Related to Its Genus?
inferredcites →https://doi.org/10.1090/s0002-9904-1962-10847-7openalex-snapshot
Additivity of the genus of a graph
inferredcites →https://doi.org/10.4153/cjm-1966-081-6openalex-snapshot
The Genus, Regional Number, and Betti Number of a Graph

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.3190030102openalex-snapshot
Survey of results on the maximum genus of a graph
inferred← citeshttps://doi.org/10.1002/jgt.3190030409openalex-snapshot
A class of upper‐embeddable graphs
inferred← citeshttps://doi.org/10.1002/net.3230150108openalex-snapshot
A compilation of relations between graph invariants
inferred← citeshttps://doi.org/10.1007/bf01085632openalex-snapshot
The n-imbeddability of graphs in 2-varieties
inferred← citeshttps://doi.org/10.1007/bf01300247openalex-snapshot
On the maximum genus of some graphs with upper imbeddable subgraphs
inferred← citeshttps://doi.org/10.1007/bf02925564openalex-snapshot
Sulla tracciabilita' di grafi finiti su superficie compatte
inferred← citeshttps://doi.org/10.1007/bfb0066436openalex-snapshot
Some recent results in topological graph theory
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90148-6openalex-snapshot
An additivity theorem for maximum genus of a graph
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90059-5openalex-snapshot
Upper-embeddable graphs and related topics
inferred← citeshttps://doi.org/10.4153/cjm-1974-096-2openalex-snapshot
The Maximum Genus of Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.4153/s0008414x24000695openalex-snapshot
Graphes dans les surfaces et ergodicité topologique
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.