Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian

DOI10.1006/JCTB.1999.1942zbMath1028.05060OpenAlexW2035039859MaRDI QIDQ1569076

Gregory Gutin, Anders Yeo

Publication date: 25 June 2000

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

Full work available at URL: https://semanticscholar.org/paper/3030e2fe4c7ddf616721d26a7a0882f624a13aae

Mathematics Subject Classification ID

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

Related Items (1)

Hamilton cycles in digraphs of unitary matrices

Cites Work

• Matching theory
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
• Generalizations of tournaments: A survey
• Tools for studying paths and cycles in digraphs
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian