Name: Hamilton Cycles in Oriented Graphs
Creator: Roland Häggkvist
Keywords: Eulerian and Hamiltonian graphs, Extremal problems in graph theory, outdegree, oriented graph, indegree, Directed graphs (digraphs), tournaments, 0102 computer and information sciences, Hamilton cycles, 01 natural sciences

Hamilton cycles in oriented graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1993 English Publisher:Cambridge University Press (CUP)Journal:Combinatorics, Probability and Computing, volume 2, pages 25-32 (issn: 0963-5483, eissn: 1469-2163,

Authors: Roland Häggkvist;

doi: 10.1017/s0963548300000468

Hamilton Cycles in Oriented Graphs

- Summary
- Subjects
- Metrics

Abstract

It is shown that an oriented graph of order n whose every indegree and outdegree is at least cn is hamiltonian if c ≥ ½ − 2−15 but need not be if c < ⅜.

Related Organizations

Umeå University
Sweden

Keywords

Eulerian and Hamiltonian graphs, Extremal problems in graph theory, outdegree, oriented graph, indegree, Directed graphs (digraphs), tournaments, Hamilton cycles

Impact byBIP!

	citations 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).	24
	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