Premium
Orientations of hamiltonian cycles in large digraphs
Author(s) -
Wojda Adam Paweł
Publication year - 1986
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190100210
Subject(s) - digraph , mathematics , hamiltonian path , combinatorics , hamiltonian (control theory) , discrete mathematics , graph , mathematical optimization
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom