On the public citation graph
On separating sets of edges in contraction-critical graphs
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.
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.1007/bf01396547openalex-snapshot
A contraction theorem for abstract graphs
inferredcites →https://doi.org/10.1007/bf01594196openalex-snapshot
Über eine Eigenschaft der ebenen Komplexe
inferredcites →https://doi.org/10.1007/bf01894573openalex-snapshot
On odd circuits in chromatic graphs
inferredcites →https://doi.org/10.1007/bf02020271openalex-snapshot
Maximum-Minimum Sätze über Graphen
inferredcites →https://doi.org/10.1007/bf02052726openalex-snapshot
Über trennende Eckenmengen in homomorphiekritischen Graphen
inferredcites →https://doi.org/10.1112/jlms/s1-27.1.85openalex-snapshot
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
inferredcites →https://doi.org/10.1515/crll.1960.204.116openalex-snapshot
Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
inferredcites →https://doi.org/10.1515/crll.1964.214-215.43openalex-snapshot
On the structure of 5- and 6-chromatic abstract graphs.
inferredcites →https://doi.org/10.4064/fm-40-1-42-55openalex-snapshot
The structure of k-chromatic 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/9781118032497.ch6openalex-snapshot
The Conjectures of Hadwiger and Hajós
inferred← citeshttps://doi.org/10.1006/jctb.1995.1049openalex-snapshot
An Abstract Generalization of a Map Reduction Theorem of Birkhoff
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_40openalex-snapshot
Graph Coloring and the Immersion Order
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90057-4openalex-snapshot
Color-critical graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.009openalex-snapshot
Cliques, minors and apex graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.01.011openalex-snapshot
On the structure of k-connected graphs without Kk-minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.04.004openalex-snapshot
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.02.001openalex-snapshot
Connectivities for k -knitted graphs and for minimal counterexamples to Hadwigerʼs Conjecture
inferred← citeshttps://doi.org/10.46298/dmtcs.589openalex-snapshot
Immersion containment and connectivity in color-critical graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1206openalex-snapshot
On a special case of Hadwiger's conjecture
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.