On the public citation graph

Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner

https://doi.org/10.1007/bf01351673
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/mana.19600220107openalex-snapshot
In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
inferredcites →https://doi.org/10.1007/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01359971openalex-snapshot
Anwendung einer Methode von K. Wagner bei F�rbungsproblemen f�r Graphen
inferredcites →https://doi.org/10.1007/bf01360256openalex-snapshot
Bemerkungen zu Hadwigers Vermutung
inferredcites →https://doi.org/10.1007/bf01361181openalex-snapshot
Beweis einer Abschw�chung der Hadwiger-Vermutung
inferredcites →https://doi.org/10.1007/bf01361705openalex-snapshot
Bemerkungen �ber ebene Graphen
inferredcites →https://doi.org/10.1007/bf01361706openalex-snapshot
�ber einen Satz von K. Wagner zum Vierfarbenproblem
inferredcites →https://doi.org/10.1007/bf01361708openalex-snapshot
Homomorphism theorems for graphs
inferredcites →https://doi.org/10.1007/bf01470944openalex-snapshot
Homomorphiebasen von Graphenmengen
inferredcites →https://doi.org/10.1007/bf01594196openalex-snapshot
Über eine Eigenschaft der ebenen Komplexe
inferredcites →https://doi.org/10.1016/s1385-7258(61)50045-5openalex-snapshot
A theory of 3-connected graphs
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs
inferredcites →https://doi.org/10.1515/crll.1964.214-215.43openalex-snapshot
On the structure of 5- and 6-chromatic abstract 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/jgt.3190070215openalex-snapshot
Graph decomposition with applications to subdivisions and path systems modulo k
inferred← citeshttps://doi.org/10.1002/jgt.3190110210openalex-snapshot
Subcontraction‐equivalence and Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1002/mana.19670330108openalex-snapshot
Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
inferred← citeshttps://doi.org/10.1006/jctb.2001.2089openalex-snapshot
Generating Internally Four-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-37051-9_1openalex-snapshot
Optimal Register Allocation in Polynomial Time
inferred← citeshttps://doi.org/10.1007/bf01350657openalex-snapshot
Homomorphies�tze f�r Graphen
inferred← citeshttps://doi.org/10.1007/bf01917434openalex-snapshot
S-functions for graphs
inferred← citeshttps://doi.org/10.1007/bf02579242openalex-snapshot
Some remarks on universal graphs
inferred← citeshttps://doi.org/10.1007/bf02941329openalex-snapshot
A Note on partial 3-trees and homomorphism bases of graphs
inferred← citeshttps://doi.org/10.1007/bf02992931openalex-snapshot
Zur Theorie dern-fach zusammenhängenden Graphen
inferred← citeshttps://doi.org/10.1007/s12188-016-0161-2openalex-snapshot
Rudolf Halin: 1934–2014
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90084-8openalex-snapshot
Simplicial decompositions of graphs: a survey of applications
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90150-gopenalex-snapshot
Clique-sums, tree-decompositions and compactness
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90330-5openalex-snapshot
Decomposing infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90118-jopenalex-snapshot
Simplicial tree-decompositions of infinite graphs, I
inferred← citeshttps://doi.org/10.1016/b978-0-12-701225-4.50017-3openalex-snapshot
RETRACTED: References
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.015openalex-snapshot
The complexity of register allocation
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.022openalex-snapshot
Dynamic coloring of graphs having no K5 minor
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.027openalex-snapshot
The tree-width of C
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70500-4openalex-snapshot
Simplicial Decompositions of Infinite Graphs
inferred← citeshttps://doi.org/10.1145/2463596.2463598openalex-snapshot
Optimal placement of bank selection instructions in polynomial time
inferred← citeshttps://doi.org/10.1145/2764967.2764971openalex-snapshot
Bytewise Register Allocation
inferred← citeshttps://doi.org/10.1145/3493229.3493304openalex-snapshot
lospre in linear time
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.