We only have this paper's title and publication details.
Read it at the sourceWe prove that almost every r -regular digraph is Hamiltonian for all fixed r ≥ 3.
No takes yet. Share an insight, caveat, or question.
Cooper et al. (1994) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: