Orientations of hamiltonian cycles in large digraphs

Adam Paweł Wojda

Research output: Contribution to journalArticleAcademic

5 Citations (Scopus)

Abstract

We prove that, with some exceptions, every digraph with n ≥ 9 vertices and at least (n - 1) (n - 2) + 2 arcs contains all orientations of a Hamiltonian cycle.
Original languageUndefined
Pages (from-to)211-218
JournalJournal of graph theory
Volume10
Issue number2
DOIs
Publication statusPublished - 1986
Externally publishedYes

Keywords

  • IR-70816

Cite this