The following pages link to Géza Tóth (Q178539):
Displaying 5 items.
- Improving the crossing lemma by finding more crossings in sparse graphs (Q854708) (← links)
- Graphs drawn with few crossings per edge (Q1272189) (← links)
- Note on the Erdős-Szekeres theorem (Q1387857) (← links)
- PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE (Q5493891) (← links)
- Two trees are better than one (Q6515039) (← links)
