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

Adam Pawel Wojda

O Technology

P O Box

Twente Unlverslty

English

We prove that, with some exceptions, every digraph with n 3 9 vertices and at least ( n- 1) (n- 2) + 2 arcs contains all orientations of a Hamil-tonian cycle

CiteSeerX

Orientations of Hamiltonian Cycles in Large Digraphs

Chemins et circuits dans les graphes orient& Ann.

Cycles in digraphs-a survey,

Extremal non-(p, q)-Hamiltonian graphs,

On Hamilton's ideals,

On maximal circuits in directed graphs,

On the existence of D(n,p) in digraphs,

Some conditions for digraphs to be Hamiltonian,

Sufficient conditions for circuits in graphs, Proc. London 163-168. tonian cycles in digraphs, to appear.

http://purl.utwente.nl/publications/70816

Orientations of hamiltonian cycles in large digraphs

Orientations of hamiltonian cycles in large digraphs

Abstract

Similar works

Full text

Available Versions

CiteSeerX