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

In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non…

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

Redundant Arrays of Independent Disks (RAID) systems have come into widespread use because of their enhanced I/O bandwidths…

2002

A mesh optical resilience solution has many requirements, some of which conflict with others. This article highlights the issues…

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…

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…

1985

We investigate the problem of embedding graphs in books. A book is some number of half-planes (the pages of the book), which…

1975

Let $Q = \{ q_1 ,q_2 , \cdots ,q_m \} $ be a family of finite, nonempty sets, and $S = \cup_{q_i \in Q} \{ q_i \} $. Suppose…