Hamiltonian paths in oriented graphs

DOI10.1016/0095-8956(76)90030-7MaRDI QIDQ1212471zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente

Cited in

(13)

• About some cyclic properties in digraphs
• Hamiltonian-connected tournaments
• An Ore-type condition implying a digraph to be pancyclic
• A short proof of Meyniel's theorem
• A theorem on pancyclic-oriented graphs
• One-to-one disjoint path covers in digraphs
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Extremal problems involving neighborhood unions
• Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
• A new sufficient condition for a 2-strong digraph to be Hamiltonian
• On three conjectures of Thomassen and the extremal digraphs for two conjectures of Nash-Williams
• Degree conditions for disjoint path covers in digraphs
• \(k\)-Ordered Hamilton cycles in digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1212471)