Hamilton Cycles in Oriented Graphs

Roland Häggkvist

Source record

Source: Crossref

Published: Mar 1, 1993

DOI: 10.1017/s0963548300000468

Open original source ↗

Source 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 < ⅜.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.