Hamiltonian paths in infinite graphs

This publication has 7 references indexed in Scilit:

• On the complexity of finding the chromatic number of a recursive graph I: the bounded case
  Annals of Pure and Applied Logic, 1989
• Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
  Journal of the ACM, 1986
• A survey of lattices of r.e. substructures
  Proceedings of Symposia in Pure Mathematics, 1985
• Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
  Discrete Mathematics, 1984
• Effective coloration
  The Journal of Symbolic Logic, 1976
• Recursive Euler and Hamilton paths
  Proceedings of the American Mathematical Society, 1976
• Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
  Proceedings of the London Mathematical Society, 1972