论文信息 - Remarks on hamiltonian digraphs

Remarks on hamiltonian digraphs

An oriented graph is an out-tournament if the out-neighbourhood of every vertex is a tournament. This note is motivated by A. Kemnitz and B. Greger, Gongr. Numer. 130 (1998) 127-131. We show that the main result of the paper by Kemnitz and Greger is an easy consequence of the characterization of hamiltonian out-tournaments by Bang-Jensen, Huang and Prisner, J. Gombin. Theory Ser. B 59 (1993) 267-287. We also disprove a conjecture from the paper of Kemnitz and Greger.

Gregory Gutin | Anders Yeo | G. Gutin | Anders Yeo

[1] Gregory Gutin,et al. Sufficient conditions for a digraph to be Hamiltonian , 1996, J. Graph Theory.

[2] David H. Bailey,et al. Algorithms and applications , 1988 .

[3] Jørgen Bang-Jensen,et al. In-Tournament Digraphs , 1993, J. Comb. Theory, Ser. B.

[4] David P. Sumner,et al. Every connected, locally connected nontrivial graph with no induced claw is hamiltonian , 1979, J. Graph Theory.

[5] Arnfried Kemnitz,et al. A Forbidden Subdigraph Condition Implying An Oriented Graph To Be Hamiltonian , 1998 .

[6] Geng-Hua Fan,et al. New sufficient conditions for cycles in graphs , 1984, J. Comb. Theory, Ser. B.

[7] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .

[8] Gregory Gutin,et al. Generalizations of tournaments: A survey , 1998, J. Graph Theory.

[9] Lutz Volkmann,et al. Cycles in multipartite tournaments: results and problems , 2002, Discret. Math..