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… 
2013
2013
The Coupling Method for Inhomogeneous Random Intersection Graphs
We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we apply the… 
2012
2012
Thornhill : Parasite-stress promotes assortative sociality
In this commentary we suggest that Fincher & Thornhill’s (F&T’s) parasite-stress theory of social behaviors and attitudes can be… 
2009
2009
Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model
2002
2002
A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience
A mesh optical resilience solution has many requirements, some of which conflict with others. This article highlights the issues… 
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… 
1996
1996
Reengineering a Single Threaded Embedded Missile Application onto a Parallel Processing Platform Using MetaH
This paper describes a software/hardware architectural transformation of a single threaded, cyclic executive based missile… 
1996
1996
The graph of triangulations of a convex polygon
When two adjacent triangles in a triangulation of a point set S form a convex quadrilateral then the common diagonal can be… 
1995
1995
Hamiltonicity of 5-Connected Toroidal Triangulations
In this article, we prove that a 5-connected toroidal triangulation has a contractible Hamilton cycle. © 1995 John Wiley & Sons… 
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… 
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)