Recursive Euler and Hamilton Paths

DOI10.2307/2041731MaRDI QIDQ4091988zbMATH OpenOpenAlexFDO

Authors Dwight R. Bean

Publication date 1976

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

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(11)

• Hamiltonian paths in infinite graphs
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• A theory of recursive dimension of ordered sets
• Prime labelings of infinite graphs
• Computing planarity in computable planar graphs
• Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
• Linear constraint query languages expressive power and complexity
• Translation-like actions by \(\mathbb{Z} \), the subgroup membership problem, and Medvedev degrees of effective subshifts
• Paths, ends and the separation problem for infinite graphs
• Queries with external predicates
• \(A\)-computable graphs

This page was built for publication: Recursive Euler and Hamilton Paths

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