Projects per year
Abstract
Given a digraph D. let delta(0)(D) := min{delta(+)(D), delta()(D)} be the minimum semidegree of D. D is kordered Hamiltonian if for every sequence s(l).....s(k) of distinct vertices of D there is a directed Hamilton cycle which encounters s(l.).....s(k) in this order. Our main result is that every digraph D of sufficiently large order n with delta(0)(D) >= [(n + k)/2]  I is kordered Hamiltonian. The bound oil the minimum semidegree is best possible. An undirected version of this result was proved earlier by Kierstead, Sarkozy and Selkow [H. Kierstead. G. Sarkozy. S. Selkow, On kordered Hamiltonian graphs, J. Graph Theory 32 (1999) 1725]. (c) 2008 Elsevier Inc. All rights reserved.
Original language  English 

Pages (fromto)  11651180 
Number of pages  16 
Journal  Journal of Combinatorial Theory. Series B 
Volume  98 
Issue number  6 
DOIs  
Publication status  Published  1 Nov 2008 
Keywords
 Linkedness
 Directed graphs
 Hamilton cycles
 Ordered cycles
Fingerprint
Dive into the research topics of 'kOrdered Hamilton cycles in digraphs'. Together they form a unique fingerprint.Projects
 1 Finished

Directed graphs and the regularity method
Engineering & Physical Science Research Council
1/10/07 → 31/03/11
Project: Research Councils