The consecutive-4 digraphs are Hamiltonian

檔案

日期

1999-05-01

期刊名稱

JOURNAL OF GRAPH THEORY

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料