On the public citation graph

Einbettung von Streckenkomplexen in die Ebene

https://doi.org/10.1007/bf01361186
0 signed · 22 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/978-3-322-98479-1openalex-snapshot
Einführung in die kombinatorische Topologie
inferredcites →https://doi.org/10.1007/bf01175677openalex-snapshot
Streckenkomplexe auf Fl�chen
inferredcites →https://doi.org/10.1007/bf01361705openalex-snapshot
Bemerkungen �ber ebene Graphen
inferredcites →https://doi.org/10.1007/bf01363288openalex-snapshot
�ber simpliziale Zerf�llungen beliebiger (endlicher oder unendlicher) Graphen
inferredcites →https://doi.org/10.1007/bf01578784openalex-snapshot
Das topologische Problem der gedruckten Schaltung und seine Lösung
inferredcites →https://doi.org/10.4064/fm-15-1-271-283openalex-snapshot
Sur le problème des courbes gauches en Topologie
inferredcites →https://doi.org/10.4064/fm-21-1-73-84openalex-snapshot
Planar Graphs
inferredcites →https://doi.org/10.4064/fm-28-1-22-32openalex-snapshot
A combinatorial condition for planar graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cta.4490010205openalex-snapshot
On the mathematical formulation of the wiring problem
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_51openalex-snapshot
Planarity Testing of Graphs on Base of a Spring Model
inferred← citeshttps://doi.org/10.1007/978-3-322-84013-4_11openalex-snapshot
Einbettung planarer Graphen in die Ebene
inferred← citeshttps://doi.org/10.1007/978-94-009-7154-7_11openalex-snapshot
Embedding of planar graphs in the plane
inferred← citeshttps://doi.org/10.1007/bf01298403openalex-snapshot
�ber endliche, ebene Eulersche und paare, kubische Graphen
inferred← citeshttps://doi.org/10.1007/bf01350666openalex-snapshot
Ein kombinatorischer Beweis des Satzes von Kuratowski zur Charakterisierung ebener Graphen
inferred← citeshttps://doi.org/10.1007/bf01575933openalex-snapshot
Die Lösung des Problems der topologischen Schaltungsintegration
inferred← citeshttps://doi.org/10.1007/bf02242387openalex-snapshot
Normalformen planarer Graphen
inferred← citeshttps://doi.org/10.1007/bf02242388openalex-snapshot
Normalformen planarer Graphen
inferred← citeshttps://doi.org/10.1007/bf02948786openalex-snapshot
Orthogonal drawings of graphs for the automation of VLSI circuit design
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.02.003openalex-snapshot
Tree amalgamation of graphs and tessellations of the Cantor sphere
inferred← citeshttps://doi.org/10.1109/tct.1970.1083103openalex-snapshot
Embedding a graph in a plane with certain constraints
inferred← citeshttps://doi.org/10.1109/tct.1973.1083768openalex-snapshot
Computer-aided topological design for integrated circuits
inferred← citeshttps://doi.org/10.1137/0216061openalex-snapshot
On the Optimal Layout of Planar Graphs with Fixed Boundary
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.