On the public citation graph
Disproof of the List Hadwiger Conjecture
0 signed · 49 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.1006/jctb.1994.1062openalex-snapshot
Every Planar Graph Is 5-Choosable
inferredcites →https://doi.org/10.1006/jctb.2000.2013openalex-snapshot
The Extremal Function for Complete Minors
inferredcites →https://doi.org/10.1007/bf01202354openalex-snapshot
Hadwiger's conjecture forK 6-free graphs
inferredcites →https://doi.org/10.1007/bf01594196openalex-snapshot
Über eine Eigenschaft der ebenen Komplexe
inferredcites →https://doi.org/10.1007/bf02579141openalex-snapshot
Lower bound of the hadwiger number of graphs by their average degree
inferredcites →https://doi.org/10.1016/0012-365x(93)90579-iopenalex-snapshot
List colourings of planar graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.03.027openalex-snapshot
List colourings of planar graphs
inferredcites →https://doi.org/10.1016/j.disc.2007.03.059openalex-snapshot
On choosability of some complete multipartite graphs and Ohba's conjecture
inferredcites →https://doi.org/10.1016/j.disc.2007.07.089openalex-snapshot
Another proof of the 5-choosability of K5 -minor-free graphs
inferredcites →https://doi.org/10.1016/j.ejc.2010.05.015openalex-snapshot
Contractibility and the Hadwiger Conjecture
inferredcites →https://doi.org/10.1016/j.jctb.2005.07.008openalex-snapshot
The extremal function for K9 minors
inferredcites →https://doi.org/10.1016/j.jctb.2006.11.002openalex-snapshot
A relaxed Hadwiger's Conjecture for list colorings
inferredcites →https://doi.org/10.1016/j.jctb.2017.08.006openalex-snapshot
K6 minors in 6-connected graphs of bounded tree-width
inferredcites →https://doi.org/10.1016/s0012-365x(98)00158-7openalex-snapshot
Choosability of K5-minor-free graphs
inferredcites →https://doi.org/10.1017/cbo9780511721328.012openalex-snapshot
List colourings of graphs
inferredcites →https://doi.org/10.1017/s0305004100061521openalex-snapshot
An extremal function for contractions of graphs
inferredcites →https://doi.org/10.1090/trans2/132/03openalex-snapshot
On the minimum of the Hadwiger number for graphs with a given mean degree of vertices
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.1137/100796649openalex-snapshot
Thomassen's Choosability Argument Revisited
inferredcites →https://doi.org/10.1145/1536414.1536476openalex-snapshot
Hadwiger's conjecture is decidable
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_42openalex-snapshot
Degenerated induced subgraphs of planar graphs
inferred← citeshttps://doi.org/10.1007/s00493-018-3733-1openalex-snapshot
Defective Colouring of Graphs Excluding A Subgraph or Minor
inferred← citeshttps://doi.org/10.1016/j.aim.2023.109020openalex-snapshot
Breaking the degeneracy barrier for coloring graphs with no K minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.02.001openalex-snapshot
Connectivity and choosability of graphs with no K minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.05.004openalex-snapshot
Local Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.08.005openalex-snapshot
Bipartite graphs with no K6 minor
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.018openalex-snapshot
Unsolved graph colouring problems
inferred← citeshttps://doi.org/10.1017/s0963548322000116openalex-snapshot
Improved lower bound for the list chromatic number of graphs with no K t minor
inferred← citeshttps://doi.org/10.1017/s0963548323000354openalex-snapshot
On the choosability of -minor-free graphs
inferred← citeshttps://doi.org/10.1090/jams/1047openalex-snapshot
Reducing linear Hadwiger’s conjecture to coloring small graphs
inferred← citeshttps://doi.org/10.1090/tran/9493openalex-snapshot
Limits of degeneracy for colouring graphs with forbidden minors
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567041openalex-snapshot
A graph minor perspective to network coding: Connecting algebraic coding with network topologies
inferred← citeshttps://doi.org/10.1109/tit.2014.2336836openalex-snapshot
A Graph Minor Perspective to Multicast Network Coding
inferred← citeshttps://doi.org/10.1137/22m1522413openalex-snapshot
Refined List Version of Hadwiger’s Conjecture
inferred← citeshttps://doi.org/10.1142/s1793830914500359openalex-snapshot
Disproof of the group coloring version of the Hadwiger conjecture
inferred← citeshttps://doi.org/10.37236/4265openalex-snapshot
Maximum 4-Degenerate Subgraph of a Planar Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6510openalex-snapshot
A Note on Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09378openalex-snapshot
Breaking the degeneracy barrier for coloring graphs with no $K_t$ minor
inferred← citeshttps://doi.org/10.48550/arxiv.2004.10367openalex-snapshot
Connectivity and choosability of graphs with no $K_t$ minor
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-071openalex-snapshot
Refined list version 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.