On the public citation graph

Homomorphiebasen von Graphenmengen

https://doi.org/10.1007/bf01470944
0 signed · 16 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/bf01360256openalex-snapshot
Bemerkungen zu Hadwigers Vermutung

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.23174openalex-snapshot
Universal graphs with forbidden wheel minors
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/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
inferred← citeshttps://doi.org/10.1007/bf01351673openalex-snapshot
Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
inferred← citeshttps://doi.org/10.1007/bf01359972openalex-snapshot
Primit�t und Homomorphie von ebenen Dreiecksgraphen
inferred← citeshttps://doi.org/10.1007/bf01361705openalex-snapshot
Bemerkungen �ber ebene Graphen
inferred← citeshttps://doi.org/10.1007/bf01361706openalex-snapshot
�ber einen Satz von K. Wagner zum Vierfarbenproblem
inferred← citeshttps://doi.org/10.1007/bf01363288openalex-snapshot
�ber simpliziale Zerf�llungen beliebiger (endlicher oder unendlicher) Graphen
inferred← citeshttps://doi.org/10.1007/bf01917434openalex-snapshot
S-functions for graphs
inferred← citeshttps://doi.org/10.1007/s00493-005-0025-7openalex-snapshot
Graphs With 3n−6 Edges Not Containing A Subdivision Of K 5
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(93)90510-zopenalex-snapshot
Optimal decomposition by clique separators
inferred← citeshttps://doi.org/10.1017/cbo9780511721335.008openalex-snapshot
Recent Excluded Minor Theorems for Graphs
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.