Reverse Mathematics and Recursive Graph Theory
  We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs, Euler paths, and Hamilton paths. 
William Gasarch and Jeffry Hirst