The consecutive-4 digraphs are Hamiltonian

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chang, GJ	en_US
dc.contributor.author	Hwang, FK	en_US
dc.contributor.author	Tong, LD	en_US
dc.date.accessioned	2014-12-08T15:46:37Z	-
dc.date.available	2014-12-08T15:46:37Z	-
dc.date.issued	1999-05-01	en_US
dc.identifier.issn	0364-9024	en_US
dc.identifier.uri	http://hdl.handle.net/11536/31358	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.subject	Hamiltonian circuit	en_US
dc.subject	consecutive-d digraph	en_US
dc.subject	network	en_US
dc.subject	loop	en_US
dc.title	The consecutive-4 digraphs are Hamiltonian	en_US
dc.type	Article	en_US
dc.identifier.journal	JOURNAL OF GRAPH THEORY	en_US
dc.citation.volume	31	en_US
dc.citation.issue	1	en_US
dc.citation.spage	1	en_US
dc.citation.epage	6	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000081261800001	-
dc.citation.woscount	4	-
Appears in Collections:	Articles

Files in This Item:

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.