On the public citation graph
Hamiltonian paths in infinite graphs
0 signed · 38 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0012-365x(84)90046-3openalex-snapshot
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
inferredcites →https://doi.org/10.1016/0095-8956(92)90057-5openalex-snapshot
On the strength of König's duality theorem for infinite bipartite graphs
inferredcites →https://doi.org/10.1016/0168-0072(89)90029-8openalex-snapshot
On the complexity of finding the chromatic number of a recursive graph I: the bounded case
inferredcites →https://doi.org/10.1090/pspum/042/791067openalex-snapshot
A survey of lattices of r.e. substructures
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0416888-0openalex-snapshot
Recursive Euler and Hamilton Paths
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1112/plms/s3-25.4.615openalex-snapshot
Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
inferredcites →https://doi.org/10.1145/4904.4993openalex-snapshot
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19980440405openalex-snapshot
Reverse Mathematics and Recursive Graph Theory
inferred← citeshttps://doi.org/10.1002/mma.3301openalex-snapshot
Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_177openalex-snapshot
Towards a theory of recursive structures
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_99openalex-snapshot
Unbounded search and recursive graph problems
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_96openalex-snapshot
Linear constraint query languages expressive power and complexity
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_15openalex-snapshot
Towards a theory of recursive structures
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_30openalex-snapshot
Hamiltonicity of automatic graphs
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_11openalex-snapshot
Index Sets in Recursive Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_3openalex-snapshot
Standing on the Shoulders of a Giant
inferred← citeshttps://doi.org/10.1007/bfb0015255openalex-snapshot
Towards a theory of recursive structures
inferred← citeshttps://doi.org/10.1007/bfb0055756openalex-snapshot
Towards a theory of recursive structures
inferred← citeshttps://doi.org/10.1007/s00153-013-0359-2openalex-snapshot
Domatic partitions of computable graphs
inferred← citeshttps://doi.org/10.1007/s001530050125openalex-snapshot
0-1 laws for recursive structures
inferred← citeshttps://doi.org/10.1007/s00373-016-1725-8openalex-snapshot
Computing Planarity in Computable Planar Graphs
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80046-3openalex-snapshot
Chapter 13 Π10 classes in mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80049-9openalex-snapshot
Chapter 16 A survey of recursive combinatorics
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80018-4openalex-snapshot
∏10 Classes in Computability Theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00266-6openalex-snapshot
Binary search and recursive graph problems
inferred← citeshttps://doi.org/10.1109/ccc.1998.694596openalex-snapshot
Theory of periodically specified problems: complexity and approximability
inferred← citeshttps://doi.org/10.1109/lics.1996.561361openalex-snapshot
More about recursive structures: descriptive complexity and zero-one laws
inferred← citeshttps://doi.org/10.1109/sct.1993.336518openalex-snapshot
Taking it to the limit: on infinite variants of NP-complete problems
inferred← citeshttps://doi.org/10.1305/ndjfl/1040046141openalex-snapshot
Infinite Versions of Some Problems from Finite Complexity Theory
inferred← citeshttps://doi.org/10.2172/587665openalex-snapshot
Theory of periodically specified problems: Complexity and approximability
inferred← citeshttps://doi.org/10.2178/jsl/1268917499openalex-snapshot
Some natural decision problems in automatic graphs
inferred← citeshttps://doi.org/10.2307/421164openalex-snapshot
1994–1995 Winter Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.3233/fun-2002-50105openalex-snapshot
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.