Pages that link to "Item:Q3980622"
From MaRDI portal
The following pages link to Do 3n − 5 edges force a subdivision ofK5? (Q3980622):
Displaying 12 items.
- Independent paths and \(K_{5}\)-subdivisions (Q602715) (← links)
- What is on his mind? (Q709300) (← links)
- The Kelmans-Seymour conjecture. IV: A proof (Q777491) (← links)
- \(3n-5\) edges do force a subdivision of \(K_5\) (Q1307446) (← links)
- Dirac's conjecture on \(K_ 5\)-subdivisions (Q1356785) (← links)
- Subdivisions in planar graphs (Q1366603) (← links)
- Can we create large \(k\)-cores by adding few edges? (Q1625143) (← links)
- An algorithm for delta-wye reduction of almost-planar graphs (Q2197481) (← links)
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) (Q2347843) (← links)
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs (Q2496200) (← links)
- Graphs containing topological \(H\) (Q2811199) (← links)
- An extremal problem for subdivisions ofK?5 (Q4238041) (← links)
