Remarks on Hamiltonian digraphs (Q2712516)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Remarks on Hamiltonian digraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Remarks on Hamiltonian digraphs |
scientific article |
Statements
9 November 2001
0 references
Hamiltonian digraphs
0 references
0.95082396
0 references
0 references
0 references
Remarks on Hamiltonian digraphs (English)
0 references
An oriented graph is an out-tournament if the out-neighbourhood of every vertex is a tournament. It was proved by \textit{J. Bang-Jensen, J. Huang} and \textit{E. Prisner} [J. Comb. Theory, Ser. B 59, No. 2, 267-287 (1993; Zbl 0794.05033)] that an out-tournament with at least two vertices is Hamiltonian if and only if it is strong. In this paper it is shown that the mentioned result implies a sufficient condition for directed graphs to be Hamiltonian which was proved by \textit{A. Kemnitz} and \textit{B. Greger} [Congr. Numerantium 130, 127-131 (1998; Zbl 0952.05030)]. Moreover, a counterexample to a conjecture from the paper of Kemnitz and Greger is given.
0 references
