标题: | The consecutive-4 digraphs are Hamiltonian |
作者: | Chang, GJ Hwang, FK Tong, LD 应用数学系 Department of Applied Mathematics |
关键字: | Hamiltonian circuit;consecutive-d digraph;network;loop |
公开日期: | 1-五月-1999 |
摘要: | 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 OF GRAPH THEORY |
Volume: | 31 |
Issue: | 1 |
起始页: | 1 |
结束页: | 6 |
显示于类别: | Articles |
文件中的档案:
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.