On the public citation graph
Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
0 signed · 28 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/mana.19650280508openalex-snapshot
Einige Bemerkungen über unendliche Graphen
inferredcites →https://doi.org/10.1002/mana.19670330108openalex-snapshot
Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
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/bf01361706openalex-snapshot
�ber einen Satz von K. Wagner zum Vierfarbenproblem
inferredcites →https://doi.org/10.1007/bf01363288openalex-snapshot
�ber simpliziale Zerf�llungen beliebiger (endlicher oder unendlicher) Graphen
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1007/bf02020444openalex-snapshot
On chromatic number of graphs and set-systems
inferredcites →https://doi.org/10.1007/bfb0066788openalex-snapshot
On chromatic number of graphs and set systems
inferredcites →https://doi.org/10.1090/s0002-9904-1956-10036-0openalex-snapshot
A partition calculus in set theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/mana.19720530113openalex-snapshot
Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
inferred← citeshttps://doi.org/10.1006/jctb.1998.1878openalex-snapshot
The Game Coloring Number of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_46openalex-snapshot
Lower Bounds on Edge Searching
inferred← citeshttps://doi.org/10.1007/bf02941418openalex-snapshot
Erdös-Hajnal Well-Orderings andn-Degenerate Graphs
inferred← citeshttps://doi.org/10.1007/bf02988318openalex-snapshot
On graphsG for which all large trees areG-good
inferred← citeshttps://doi.org/10.1007/s11083-022-09601-xopenalex-snapshot
Applications of Order Trees in Infinite Graphs
inferred← citeshttps://doi.org/10.1007/s12188-016-0170-1openalex-snapshot
Hadwiger’s conjecture for uncountable graphs
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(91)90330-5openalex-snapshot
Decomposing infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90017-0openalex-snapshot
Critically partitionable graphs, I
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90054-2openalex-snapshot
The structure of TKa-free graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70500-4openalex-snapshot
Simplicial Decompositions of Infinite Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1992-1079057-3openalex-snapshot
Excluding Subdivisions of Infinite Cliques
inferred← citeshttps://doi.org/10.20429/tag.2024.000105openalex-snapshot
A Survey of Maximal k-Degenerate Graphs and k-Trees
inferred← citeshttps://doi.org/10.37236/9619openalex-snapshot
Quickly Proving Diestel's Normal Spanning Tree Criterion
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.