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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

The symmetric group is generated by {\sigma} = (1 2 ... n) and {\tau} = (1 2). We answer an open problem of Nijenhuis and Wilf by…

2013

Department of Mathematics, Faculty of Science, Benghazi University, Libya Department of Mathematical Sciences, Faculty of Science…

2013

Graph theory is widely used as a tool of encryption, due to its various properties and its representation as a matrix. Time…

2013

Let n ≥ 5 be an odd integer and K n the complete graph on n vertices. Let i be an integer with 2 ≤ i ≤ (n − 1)/2. A hamiltonian…

2012

In this commentary we suggest that Fincher & Thornhill’s (F&T’s) parasite-stress theory of social behaviors and attitudes can be…

2006

We present a new polynomial-time algorithm for finding Hamiltonian circuits in certain graphs. It is shown that the algorithm…

2006

1995

Let G be a simple undirected graph of order n. For an independent set S ⊂ V(G) of k vertices, we define the k neighborhood…

1994

We consider the problem of Hamiltonian decomposition on the hypercube. It is known that there exist bn=2c edge-disjoint…

1993

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…