Oscar Levin

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The computational strength of matchings in countable graphs
Annals of Pure and Applied Logic
2022-06-08Paper
Puzzles of cardinality
The College Mathematics Journal
2022-03-14Paper
The computational strength of matchings in countable graphs
(available as arXiv preprint)
2020-06-19Paper
Prime labelings of infinite graphs
Involve
2019-06-24Paper
Computing planarity in computable planar graphs
Graphs and Combinatorics
2017-01-13Paper
Computable dimension for ordered fields
Archive for Mathematical Logic
2016-05-13Paper
\(A\)-computable graphs
Annals of Pure and Applied Logic
2016-01-12Paper
Finding domatic partitions in infinite graphs
The Electronic Journal of Combinatorics
2015-11-02Paper
Domatic partitions of computable graphs
Archive for Mathematical Logic
2014-02-25Paper
Embeddings of computable structures
Notre Dame Journal of Formal Logic
2010-06-11Paper


Research outcomes over time


This page was built for person: Oscar Levin