Tyler Markkanen

According to our database, Tyler Markkanen authored at least 4 papers between 2014 and 2022.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2022

The computational strength of matchings in countable graphs.

Stephen Flood, Matthew Jura, Oscar Levin, Tyler Markkanen

Ann. Pure Appl. Log., 2022

2016

A-computable graphs.

Matthew Jura, Oscar Levin, Tyler Markkanen

Ann. Pure Appl. Log., 2016

2015

Finding Domatic Partitions in Infinite Graphs.

Matthew Jura, Oscar Levin, Tyler Markkanen

Electron. J. Comb., 2015

2014

Domatic partitions of computable graphs.

Matthew Jura, Oscar Levin, Tyler Markkanen

Arch. Math. Log., 2014