Long paths and cycles in oriented graphs

@article{Jackson1981LongPA,
  title={Long paths and cycles in oriented graphs},
  author={Bill Jackson},
  journal={Journal of Graph Theory},
  year={1981},
  volume={5},
  pages={145-157}
}
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. An orientedgraph is a directed simple graph, that is to say, a digraph without loops, mutiple arcs, or cycles of length two. Many authors have obtained various degree conditions which imply that certain… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS
26 Citations
2 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Longest paths in digraphs. Combinatorics 1979, proceedings of the Joint Canada-France Combinatorial Colloquium

  • J. C. Bermond, A. Germa, M. C. Heydemann, D. Sotteau
  • Ann Discrete Math. To appear
  • 1979

Paths and cycles in oriented graphs. Combinatorics 1979, proceedings of the Joint Canada-France Combinatorial Colloquium, Ann

  • B. Jackson
  • Discrete Math. to appear
  • 1979

Similar Papers

Loading similar papers…