Recursive Euler and Hamilton Paths

DOI10.2307/2041731zbMath0327.05117OpenAlexW4242218475MaRDI QIDQ4091988

Dwight R. Bean

Publication date: 1976

Full work available at URL: https://doi.org/10.2307/2041731

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computability and recursion theory (03Dxx)

Related Items

Linear constraint query languages expressive power and complexity, Prime labelings of infinite graphs, \(A\)-computable graphs, Computing planarity in computable planar graphs, Hamiltonian paths in infinite graphs, A theory of recursive dimension of ordered sets, Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes, On the complexity of finding the chromatic number of a recursive graph. I: The bounded case

Cites Work

• Degrees of members of \(\Pi_ 1^ 0\) classes
• Effective coloration
• Effective Matchmaking and k-Chromatic Graphs
• Euler Lines in Infinite Directed Graphs
• Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
• ∏ 0 1 Classes and Degrees of Theories
• Ramsey's theorem and recursion theory
• Decomposition of Graphs into Two-Way Infinite Paths