Oriented hamilton cycles in digraphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Jul 1995 English Publisher:WileyJournal:Journal of Graph Theory, volume 19, pages 471-479 (issn: 0364-9024, eissn: 1097-0118,

Copyright policy )

Authors: Roland Häggkvist; Andrew Thomason 0001;

doi: 10.1002/jgt.3190190404

Oriented hamilton cycles in digraphs

- Summary
- Subjects
- Metrics

Abstract

AbstractWe show that a directed graph of order n will contain n‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + n‐1/6)n and n is sufficiently large. © 1995 John Wiley & Sons, Inc.

Related Organizations

Umeå University
Sweden
University of Cambridge
United Kingdom

Keywords

Eulerian and Hamiltonian graphs, outdegree, indegree, Directed graphs (digraphs), tournaments, directed graph, Paths and cycles, Hamilton cycles, orientation, digraphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	12
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average