Domatic partitions of computable graphs. - Matthew Jura; Oscar Levin; Tyler Markkanen (Arch. Math. Log., 2014)

Finding Domatic Partitions in Infinite Graphs. - Matthew Jura; Oscar Levin; Tyler Markkanen (Electron. J. Comb., 2015)

A-computable graphs. - Matthew Jura; Oscar Levin; Tyler Markkanen (Ann. Pure Appl. Log., 2016)

Reverse Mathematics and the Coloring Number of Graphs. - Matthew Jura (Notre Dame J. Formal Log., 2016)

The computational strength of matchings in countable graphs. - Stephen Flood; Matthew Jura; Oscar Levin; Tyler Markkanen (Ann. Pure Appl. Log., 2022)