On the public citation graph
Über trennende Eckenmengen in homomorphiekritischen Graphen
0 signed · 27 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/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01360256openalex-snapshot
Bemerkungen zu Hadwigers Vermutung
inferredcites →https://doi.org/10.1515/crll.1960.204.116openalex-snapshot
Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
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.1002/jgt.22502openalex-snapshot
Graphs with no K9= minor are 10‐colorable
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/bf01202354openalex-snapshot
Hadwiger's conjecture forK 6-free graphs
inferred← citeshttps://doi.org/10.1007/bf01419610openalex-snapshot
On separating sets of edges in contraction-critical graphs
inferred← citeshttps://doi.org/10.1007/s00493-005-0019-1openalex-snapshot
Any 7-Chromatic Graphs Has K 7 Or K 4,4 As A Minor
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90205-7openalex-snapshot
Hadwiger's conjecture (k = 6) : Neighbour configurations of 6-vertices in contraction- critical graphs
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.2019.06.038openalex-snapshot
Minimum degree condition for a graph to be knitted
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103711openalex-snapshot
Properties of 8-contraction-critical graphs with no K7 minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.07.008openalex-snapshot
The extremal function for K9 minors
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.1016/j.jctb.2017.05.001openalex-snapshot
Coloring graphs with forbidden minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.08.006openalex-snapshot
K6 minors in 6-connected graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70305-4openalex-snapshot
Hadwiger's Conjecture (k = 6): Neighbour Configurations of 6-Vertices in Contraction-Critical Graphs
inferred← citeshttps://doi.org/10.1016/s0360-0564(08)60659-8openalex-snapshot
Multicomponent Bismuth Molybdate Catalyst: A Highly Functionalized Catalyst System for the Selective Oxidation of Olefin
inferred← citeshttps://doi.org/10.2140/involve.2020.13.829openalex-snapshot
Simple graphs of order 12 and minimum degree 6 contain K6 minors
inferred← citeshttps://doi.org/10.37236/7406openalex-snapshot
Defective and Clustered Graph Colouring
inferred← citeshttps://doi.org/10.48550/arxiv.1402.2806openalex-snapshot
Coloration of $K_7^-$-minor free 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.