Skip to search formSkip to main contentSkip to account menu

Hamiltonian path

Known as: Hamiltonian cycle, Hamilton cycle, Rudrata cycle 
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
15 puzzleArthur Hobbs (mathematician)Biconnected graphBottleneck traveling salesman problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Geometric Theory of Harmony
In the earlier article I introduced the notion of Hamiltonian cycle as a mathematical model for musical harmony and also proposed… 
2009
2009
Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model
2005
2005
Hamiltonian colorings of graphs
2003
2003
Degree conditions for k‐ordered hamiltonian graphs
For a positive integer k, a graph G is k‐ordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian… 
2003
2003
On the Complexity of Distributed Self-Configuration in Wireless Networks
We consider three distributed configuration tasks that arise in the setup and operation of multi-hop wireless networks: partition… 
2001
2001
Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection
Designing a protection scheme for a mesh WDM network is a challenging task. Extending the concept of the SONET self-healing ring… 
Highly Cited
1995
Highly Cited
1995
Male avoidance of parasitized females explained by direct benefits in a pipefish
Abstract The influence of the parasitic trematode,Cryptocotylesp., on male mate choice in a species of pipefish,Syngnathus typhle… 
1994
1994
Deterministic 1-k Routing on Meshes
In 1-k routing each of the n2 processing units of an n x n mesh connected computer initially holds 1 packet which must be routed… 
1988
1988
Efficient Parallel Triconnectivity in Logarithmic Time
We present two new techniques for trimming a logarithmic factor from the running time of efficient parallel algorithms for graph… 
Highly Cited
1978
Highly Cited
1978
Tight bounds for christofides' traveling salesman heuristic
Christofides [1] proposes a heuristic for the traveling salesman problem that runs in polynomial time. He shows that when the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)