Ordered and Ordered Hamilton Digraphs  

作　　者：WANGMU Jiang-shan YUAN Jun LIN Shang-wei WANG Shi-ying 

机构地区：[1]School of Mathematical Sciences, Sichuan University, Chengdu 610064, China [2]School of Mathe- matical Sciences, Shanxi University, Taiyuan 030006, China

出　　处：《Chinese Quarterly Journal of Mathematics》2010年第3期317-326,共10页数学季刊（英文版）

基　　金：Foundation item： Supported by the National Natural Science Foundation of China（61070229）; Supported by the Natural Science Foundation of Shanxi Province（2008011010）

摘　　要：A digraph D is k-ordered if for every sequence S：v 1,v 2,…,v k of k distinct vertices,there exists a cycle C such that C encounters the vertices of S in the specified order.In particular,we say that D is k-ordered hamiltonian if for every sequence S：v 1,v 2,…,v k of k distinct vertices,there exists a hamiltonian cycle C such that the vertices of S are encountered on C in the specified order.In this paper,sufficient conditions for digraphs to be ordered and ordered hamiltonian have been given.

关 键 词：DIGRAPHS k-ordered digraphs k-ordered hamiltonian digraphs 

分 类 号：O157.5[理学—数学]