论文信息 - Hamiltonian paths in infinite graphs

Hamiltonian paths in infinite graphs

A tight connection is exhibited between infinite paths in recursive trees and Hamiltonian paths in recursive graphs. A corollary is that determining Hamiltonicity in recursive graphs is highly undecidable, viz, Σ11-complete. This is shown to hold even for highly recursive graphs with degree bounded by 3. Hamiltonicity is thus an example of an interesting graph problem that is outside the arithmetic hierarchy in the infinite case.

David Harel

[1] William I. Gasarch,et al. On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case , 1989, Ann. Pure Appl. Log..

[2] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[3] A. Manaster,et al. EFFECTIVE MATCHMAKING (RECURSION THEORETIC ASPECTS OF A THEOREM OF PHILIP HALL) , 1972 .

[4] Richard A. Shore,et al. On the strength of König's duality theorem for infinite bipartite graphs , 1992, J. Comb. Theory, Ser. B.

[5] David Harel,et al. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness , 1986, JACM.

[6] Stefan A. Burr. Some undecidable problems involving the edge-coloring and vertex-coloring of graphs , 1984, Discret. Math..

[7] Dwight R. Bean,et al. Recursive Euler and Hamilton paths , 1976 .