Recursive Euler and Hamilton paths
Work
Year: 1976
Type: article
Abstract: We employ recursion theoretic arguments to show that Hamilton paths for locally finite graphs are more difficult to find, in general, than Euler paths. A locally finite graph is recursive if we can ef... more
Author Dwight R. Bean
Cites: 14
Cited by: 24
Related to: 10
FWCI:
Citation percentile (by year/subfield): 84.27
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze