Reverse Mathematics and Recursive Graph Theory

From MaRDI portal



Abstract: 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.











This page was built for publication: Reverse Mathematics and Recursive Graph Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4224080)