On the public citation graph

On the conjecture of hajós

https://doi.org/10.1007/bf02579269
0 signed · 64 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/bf03023063openalex-snapshot
Colouring problems
inferredcites →https://doi.org/10.1007/bfb0062512openalex-snapshot
Some extremal problems on families of graphs and related problems
inferredcites →https://doi.org/10.1016/0095-8956(79)90062-5openalex-snapshot
Hajós' graph-coloring conjecture: Variations and counterexamples
inferredcites →https://doi.org/10.1090/s0002-9904-1947-08785-1openalex-snapshot
Some remarks on the theory of graphs
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.1215/ijm/1256049898openalex-snapshot
The existence of unavoidable sets of geographically good configurations
inferredcites →https://doi.org/10.4064/cm-16-1-253-256openalex-snapshot
Some remarks on 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.1002/jgt.20341openalex-snapshot
Triangulations and the Hajós conjecture
inferred← citeshttps://doi.org/10.1002/jgt.21891openalex-snapshot
Graphs Containing Topological H
inferred← citeshttps://doi.org/10.1002/jgt.22751openalex-snapshot
4‐Separations in Hajós graphs
inferred← citeshttps://doi.org/10.1002/jgt.23020openalex-snapshot
Subdivisions with congruence constraints in digraphs of large chromatic number
inferred← citeshttps://doi.org/10.1002/jgt.3190100308openalex-snapshot
Reflections on graph theory
inferred← citeshttps://doi.org/10.1002/jgt.3190110210openalex-snapshot
Subcontraction‐equivalence and Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1002/jgt.3190130111openalex-snapshot
Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs
inferred← citeshttps://doi.org/10.1002/rsa.20215openalex-snapshot
The order of the largest complete minor in a random graph
inferred← citeshttps://doi.org/10.1002/rsa.20285openalex-snapshot
Minors in random regular graphs
inferred← citeshttps://doi.org/10.1006/eujc.1997.0188openalex-snapshot
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs
inferred← citeshttps://doi.org/10.1006/jctb.2002.2133openalex-snapshot
Topological Minors in Graphs of Large Girth
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_40openalex-snapshot
Graph Coloring and the Immersion Order
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_59-1openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_13openalex-snapshot
Hadwiger’s Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_17openalex-snapshot
The Beginnings of Geometric Graph Theory
inferred← citeshttps://doi.org/10.1007/bf01874387openalex-snapshot
Probabilistic methods in graph theory
inferred← citeshttps://doi.org/10.1007/bf02579154openalex-snapshot
Independence, clique size and maximum degree
inferred← citeshttps://doi.org/10.1007/s00373-015-1539-0openalex-snapshot
On a Coloring Conjecture of Hajós
inferred← citeshttps://doi.org/10.1007/s00493-013-2853-xopenalex-snapshot
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90066-6openalex-snapshot
Topological cliques of random 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.comgeo.2019.101574openalex-snapshot
On topological graphs with at most four crossings per edge
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.08.008openalex-snapshot
Hajós’ conjecture and cycle power graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.023openalex-snapshot
The order of the largest complete minor in a random graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2003.08.005openalex-snapshot
Graph Minors. XIX. Well-quasi-ordering on a surface
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.08.005openalex-snapshot
Some remarks on Hajós’ conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.10.001openalex-snapshot
Reducing Hajós' 4-coloring conjecture to 4-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.07.005openalex-snapshot
Coloring immersion-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.12.002openalex-snapshot
The Kelmans-Seymour conjecture IV: A proof
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.05.002openalex-snapshot
Rooted topological minors on four vertices
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.09.002openalex-snapshot
Clustered variants of Hajós' conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.10.002openalex-snapshot
Dichromatic number and forced subdivisions
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.07.010openalex-snapshot
Immersion and clustered coloring
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.04.005openalex-snapshot
Weak diameter choosability of graphs with an excluded minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.11.001openalex-snapshot
Extremal density for subdivisions with length or sparsity constraints
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00175-2openalex-snapshot
On the Hajós number of graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(80)80001-1openalex-snapshot
Hadwiger's Conjecture is True for Almost Every Graph
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73063-9openalex-snapshot
Pseudo-Random Graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.007openalex-snapshot
Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1017/s0963548300001140openalex-snapshot
Topological Cliques in Graphs
inferred← citeshttps://doi.org/10.1017/s096354830000184xopenalex-snapshot
Topological cliques in graphs II
inferred← citeshttps://doi.org/10.1090/tran/8660openalex-snapshot
Rolling backwards can move you forward: On embedding problems in sparse expanders
inferred← citeshttps://doi.org/10.1093/imrn/rnag219openalex-snapshot
The dominating 4-colour theorem
inferred← citeshttps://doi.org/10.1112/jlms.12633openalex-snapshot
Packing topological minors half‐integrally
inferred← citeshttps://doi.org/10.1137/040617765openalex-snapshot
Improved Bounds for Topological Cliques in Graphs of Large Girth
inferred← citeshttps://doi.org/10.1145/2488608.2488663openalex-snapshot
Testing subdivision-freeness
inferred← citeshttps://doi.org/10.14288/1.0042748openalex-snapshot
Chromatic number, clique subdivisions and the conjectures of Hajos and ErdHos-Fajtlowicz
inferred← citeshttps://doi.org/10.26493/1855-3974.112.b74openalex-snapshot
Immersing small complete graphs
inferred← citeshttps://doi.org/10.37236/134openalex-snapshot
Crossings, Colorings, and Cliques
inferred← citeshttps://doi.org/10.37236/1982openalex-snapshot
Triangulations and the Hajós Conjecture
inferred← citeshttps://doi.org/10.37236/3396openalex-snapshot
Remarks on a Conjecture of Barát and Tóth
inferred← citeshttps://doi.org/10.37236/345openalex-snapshot
Towards the Albertson Conjecture
inferred← citeshttps://doi.org/10.46298/dmtcs.589openalex-snapshot
Immersion containment and connectivity in color-critical graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1010.4321openalex-snapshot
To Prove Four Color Theorem
inferred← citeshttps://doi.org/10.5555/2095116.2095228openalex-snapshot
List-coloring graphs without subdivisions and without immersions
inferred← citeshttps://doi.org/10.5555/2627817.2627890openalex-snapshot
Totally odd subdivisions and parity subdivisions: structures and coloring
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.