The following pages link to Oscar Levin (Q283122):
Displaying 10 items.
- Computable dimension for ordered fields (Q283123) (← links)
- Computing planarity in computable planar graphs (Q503647) (← links)
- Finding domatic partitions in infinite graphs (Q888598) (← links)
- \(A\)-computable graphs (Q904145) (← links)
- Embeddings of computable structures (Q976535) (← links)
- Prime labelings of infinite graphs (Q2424265) (← links)
- Domatic partitions of computable graphs (Q2436619) (← links)
- The computational strength of matchings in countable graphs (Q2672158) (← links)
- Puzzles of Cardinality (Q5061622) (← links)
- The computational strength of matchings in countable graphs (Q6343310) (← links)