Pages that link to "Item:Q2496200"
From MaRDI portal
The following pages link to Reducing Hajós' 4-coloring conjecture to 4-connected graphs (Q2496200):
Displaying 11 items.
- The \(a\)-graph coloring problem (Q516830) (← links)
- Independent paths and \(K_{5}\)-subdivisions (Q602715) (← 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)
- Rooted topological minors on four vertices (Q2099413) (← links)
- Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\) (Q2568497) (← links)
- Linking four vertices in graphs of large connectivity (Q2668016) (← links)
- On a coloring conjecture of Hajós (Q5964996) (← links)
- Wheels in planar graphs and Hajós graphs (Q6056778) (← links)
- 4‐Separations in Hajós graphs (Q6057653) (← links)