A sufficient condition for oriented graphs to be Hamiltonian

DOI10.1016/0012-365X(86)90141-XzbMath0598.05037MaRDI QIDQ1079579

Odile Favaron, Oscar Ordaz

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

conjectureHamiltonian cyclek-conneted oriented graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Number of arcs and cycles in digraphs
• A Chvátal-Erdős condition for (1,1)-factors in digraphs
• On cycles and paths in digraphs
• Cycles in strong oriented graphs
• Long Cycles in Digraphs
• Cycles in digraphs– a survey
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments

This page was built for publication: A sufficient condition for oriented graphs to be Hamiltonian