The following pages link to On the conjecture of Hajos (Q1835686):
Displaying 26 items.
- Coloring immersion-free graphs (Q326817) (← links)
- Remarks on a conjecture of Barát and Tóth (Q405159) (← links)
- Topological cliques of random graphs (Q599826) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- The Kelmans-Seymour conjecture. IV: A proof (Q777491) (← links)
- Hajós' conjecture and cycle power graphs (Q966132) (← links)
- Independence, clique size and maximum degree (Q1065018) (← links)
- Hadwiger's conjecture is true for almost every graph (Q1150631) (← links)
- Topological minors in graphs of large girth (Q1403927) (← links)
- Dichromatic number and forced subdivisions (Q2072176) (← links)
- Rooted topological minors on four vertices (Q2099413) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz (Q2448966) (← links)
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs (Q2496200) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- Graphs Containing Topological<i>H</i> (Q2811199) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Topological Cliques in Graphs (Q4305319) (← links)
- Topological cliques in graphs II (Q4883063) (← links)
- Rolling backwards can move you forward: On embedding problems in sparse expanders (Q5082387) (← links)
- (Q5743487) (← links)
- The order of the largest complete minor in a random graph (Q5900071) (← links)
- On a coloring conjecture of Hajós (Q5964996) (← links)
- 4‐Separations in Hajós graphs (Q6057653) (← links)
- Packing topological minors half‐integrally (Q6134535) (← links)
- Subdivisions with congruence constraints in digraphs of large chromatic number (Q6183432) (← links)
