On the public citation graph

Die toroidale Dicke des vollst�ndigen Graphen

https://doi.org/10.1007/bf01109925
0 signed · 25 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/bf01445363openalex-snapshot
Ueber Tripelsysteme
inferredcites →https://doi.org/10.1016/s1385-7258(63)50055-9openalex-snapshot
The thickness of a graph
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11213-1openalex-snapshot
On the thickness of the complete 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.3190020306openalex-snapshot
Current graphs and bi‐embeddings
inferred← citeshttps://doi.org/10.1002/jgt.3190060212openalex-snapshot
On the toroidal thickness of graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-3554-2_9openalex-snapshot
The Unity of Combinatorics
inferred← citeshttps://doi.org/10.1007/bf02193046openalex-snapshot
Triples, current graphs and biembeddings
inferred← citeshttps://doi.org/10.1007/bfb0060104openalex-snapshot
A survey of packings and coverings of graphs
inferred← citeshttps://doi.org/10.1007/bfb0060112openalex-snapshot
A many-facetted problem of zarankiewicz
inferred← citeshttps://doi.org/10.1007/bfb0066436openalex-snapshot
Some recent results in topological graph theory
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90320-hopenalex-snapshot
Infinite families of bi-embeddings
inferred← citeshttps://doi.org/10.1016/0095-8956(82)90057-0openalex-snapshot
The toroidal thickness of the symmetric quadripartite graph
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113688openalex-snapshot
Index 3 biembeddings of the complete graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00278-2openalex-snapshot
Variations on Ringel's earth–moon problem
inferred← citeshttps://doi.org/10.1016/s0095-8956(76)80009-3openalex-snapshot
Some cases of triangular imbeddings for Kn(m)
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70187-0openalex-snapshot
An Updated Bibliography and Survey of Steiner Systems
inferred← citeshttps://doi.org/10.1016/s0304-0208(01)80011-6openalex-snapshot
Voltage Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(01)80021-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)71144-7openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0898-1221(97)00214-9openalex-snapshot
Biplanar Graphs:
inferred← citeshttps://doi.org/10.1109/tct.1971.1083266openalex-snapshot
On the biplanar crossing number
inferred← citeshttps://doi.org/10.35834/mjms/1337950501openalex-snapshot
An Annotated Bibliography on the Thickness, Outerthickness, and Arboricity of a Graph
inferred← citeshttps://doi.org/10.4153/cjm-1965-084-2openalex-snapshot
The Thickness of the Complete Graph
inferred← citeshttps://doi.org/10.48550/arxiv.2111.11671openalex-snapshot
On the bigenus of the complete graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot
Planarizing Graphs - A Survey and Annotated Bibliography
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.