✦ LIBER ✦

The consecutive-4 digraphs are Hamiltonian

✍ Scribed by Chang, Gerard J.; Hwang, Frank K.; Tong, Li-Da

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 192 KB
Volume: 31
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199905)31:1<1::aid-jgt1>3.0.co;2-i

No coin nor oath required. For personal study only.

✦ Synopsis

Du, Hsu, and Hwang conjectured that consecutive-d digraphs are Hamiltonian for d = 3, 4. Recently, we gave an infinite class of consecutive-3 digraphs

📜 SIMILAR VOLUMES

The Hamiltonian property of consecutive-

The Hamiltonian property of consecutive-d digraphs

✍ D.Z. Du; D.F. Hsu; F.K. Hwang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Cayley digraphs of prime-power order are

Cayley digraphs of prime-power order are hamiltonian

✍ Dave Witte 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Vertex-primitive digraphs of prime-power

Vertex-primitive digraphs of prime-power order are hamiltonian

✍ Ming-Yao Xu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Witte proved that every connected Cayley digraph of a p-group is hamiltonian. In this note we generalize Witte's result to connected vertex-primitive digraphs of prime-power order; namely, we prove that every connected vertex-primitive digraph of prime-power order is hamiltonian. Witte [6] proved t

The Hamiltonian property of generalized

The Hamiltonian property of generalized de Bruijn digraphs

✍ D.Z Du; D.F Hsu; F.K Hwang; X.M Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 512 KB

4-Connected Projective-Planar Graphs Are

4-Connected Projective-Planar Graphs Are Hamiltonian

✍ R. Thomas; X.X. Yu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 923 KB

A polynomial algorithm for the Hamiltoni

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

✍ Bang-Jensen, J�rgen; Gutin, Gregory; Yeo, Anders 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of such an algorithm was conjectured in G.