Premium
Long paths and cycles in oriented graphs
Author(s) -
Jackson Bill
Publication year - 1981
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.3190050204
Subject(s) - tournament , hamiltonian path , mathematics , combinatorics , bipartite graph , pancyclic graph , disjoint sets , complete bipartite graph , graph , hamiltonian path problem , discrete mathematics , path (computing) , chordal graph , 1 planar graph , computer science , programming language
We obtain several sufficient conditions on the degrees of an oriented graph for the existence of long paths and cycles. As corollaries of our results we deduce that a regular tournament contains an edge‐disjoint Hamilton cycle and path, and that a regular bipartite tournament is hamiltonian.