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.
2013
2013
Hamiltonian Chordal Graphs are not Cycle Extendable
In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non… 
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… 
2006
2006
Methods for Placing Data and Parity to Tolerate Two Disk Failures in Disk Arrays Using Complete Bipartite Graphs
Redundant Arrays of Independent Disks (RAID) systems have come into widespread use because of their enhanced I/O bandwidths… 
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 DECOMPOSITION OF COMPLETE BIPARTITE γ-HYPERGRAPHS
1998
1998
The instability of streaks in near-wall turbulence
Several aspects of the self-sustaining mechanism of near-wall turbulence have been studied recently (see Jimenez & Moin 1991… 
Review
1996
Review
1996
Combining LEDA with Customizable Implementations of Graph Algorithms
EEciency, exibility, and ease of use are desirable goals in library development, but it seems next to impossible to achieve all… 
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… 
1993
1993
Hamilton Cycles Which Extend Transposition Matchings in Cayley Graphs of S N
Let B be a basis of transpositions for S n and let Cay(B :S n) be the Cayley graph of S n with respect to B. It was shown by… 
1985
1985
Algorithms for embedding graphs in books (planar, vlsi, fault-tolerant, hamiltonian cycle, trivalent)
We investigate the problem of embedding graphs in books. A book is some number of half-planes (the pages of the book), which… 
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)