Title: The consecutive-4 digraphs are Hamiltonian
Authors: Chang, GJ
Hwang, FK
Tong, LD
應用數學系
Department of Applied Mathematics
Keywords: Hamiltonian circuit;consecutive-d digraph;network;loop
Issue Date: 1-May-1999
Abstract: 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, which are not Hamiltonian. In this article we prove the conjecture for d = 4. (C) 1999 John Wiley & Sons, Inc.
URI: http://hdl.handle.net/11536/31358
ISSN: 0364-9024
Journal: JOURNAL OF GRAPH THEORY
Volume: 31
Issue: 1
Begin Page: 1
End Page: 6
Appears in Collections:Articles


Files in This Item:

  1. 000081261800001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.