Hamiltonian paths in oriented graphs

DOI10.1016/0095-8956(76)90030-7zbMath0294.05112OpenAlexW2035438399MaRDI QIDQ1212471

Maria Overbeck-Larisch

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90030-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items

Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ Hamiltonian-connected tournaments ⋮ One-to-one disjoint path covers in digraphs ⋮ Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs ⋮ Extremal problems involving neighborhood unions ⋮ \(k\)-Ordered Hamilton cycles in digraphs ⋮ An Ore-type condition implying a digraph to be pancyclic ⋮ A short proof of Meyniel's theorem ⋮ A theorem on pancyclic-oriented graphs ⋮ About some cyclic properties in digraphs

Cites Work

• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Unnamed Item

This page was built for publication: Hamiltonian paths in oriented graphs