Recommendations
- Some natural decision problems in automatic graphs
- Hamilton-decomposable graphs and digraphs of infinite valence
- One-way infinite Hamiltonian paths in infinite maximal planar graphs
- On one-way and two-way infinite Hamiltonian paths for the Cayley graph of finitary permutations on natural numbers
- On the notion of infinite Hamiltonian graph
Cites work
- scientific article; zbMATH DE number 3914305 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
- Effective coloration
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
- On the strength of König's duality theorem for infinite bipartite graphs
- Recursive Euler and Hamilton Paths
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
Cited in
(12)- Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
- Paths and animals in infinite graphs with tempered degree growth
- Domatic partitions of computable graphs
- Is the spiral effect psychological?
- Linear constraint query languages expressive power and complexity
- 1994–1995 Winter Meeting of the Association for Symbolic Logic
- Infinite versions of some problems from finite complexity theory
- \(A\)-computable graphs
- Absolute differences along Hamiltonian paths
- Computing planarity in computable planar graphs
- Unbounded search and recursive graph problems
- Some natural decision problems in automatic graphs
This page was built for publication: Hamiltonian paths in infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196345)
