A new sufficient condition for a digraph to be Hamiltonian

DOI10.1016/S0166-218X(99)00065-7zbMath0933.05095OpenAlexW2076404940MaRDI QIDQ1302145

Anders Yeo, Yubao Guo, Jörgen Bang-Jensen

Publication date: 9 April 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00065-7

zbMATH Keywords

digraphHamiltonian

Mathematics Subject Classification ID

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

Related Items (8)

A degree sum condition for Hamiltonicity in balanced bipartite digraphs ⋮ Unnamed Item ⋮ A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Sufficient conditions for a balanced bipartite digraph to be even pancyclic ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li ⋮ A dominated pair condition for a digraph to be Hamiltonian

This page was built for publication: A new sufficient condition for a digraph to be Hamiltonian