Hamilton Cycles in Oriented Graphs
From MaRDI portal
Publication:4289304
DOI10.1017/S0963548300000468zbMath0795.05087OpenAlexW2166930583MaRDI QIDQ4289304
Publication date: 29 August 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300000468
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (11)
A note on some embedding problems for oriented graphs ⋮ Paths and cycles in extended and decomposable digraphs ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ Oriented hamilton cycles in digraphs ⋮ Antipaths in oriented graphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Hamiltonian degree sequences in digraphs ⋮ Triangle packings and 1-factors in oriented graphs ⋮ An approximate version of Jackson’s conjecture ⋮ Tournaments and Semicomplete Digraphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments
Cites Work
This page was built for publication: Hamilton Cycles in Oriented Graphs
