Remarks on Hamiltonian digraphs

MaRDI QIDQ2712516zbMATH OpenFDO

Authors G. Gutin, A. Yeo

Publication date 9 November 2001

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Review text

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.

Recommendations

• Remarks on Hamiltonian properties of powers of digraphs
• scientific article; zbMATH DE number 4087695
• On Hamiltonian powers of digraphs
• The Hamiltonian numbers in digraphs
• Notes on Hamiltonian graphs and Hamiltonian-connected graphs
• scientific article; zbMATH DE number 3893232
• Hamiltonian extension in digraphs
• Publication:5753984
• scientific article; zbMATH DE number 4204369

Cited in

(2)

• Remarks on Hamiltonian properties of powers of digraphs
• scientific article; zbMATH DE number 1536526 (Why is no real title available?)

This page was built for publication: Remarks on Hamiltonian digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2712516)