Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs

DOI10.1016/0166-218X(93)90246-KzbMath0770.05049MaRDI QIDQ1208466

Pavol Hell, Jörgen Bang-Jensen

Publication date: 16 May 1993

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

zbMATH Keywords

algorithmcyclepathtournamentin-tournament digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Subset sum problems with digraph constraints ⋮ Packing strong subgraph in digraphs ⋮ Locally Semicomplete Digraphs and Generalizations

Cites Work

• A linear-time algorithm for finding Hamiltonian cycles in tournaments
• The complexity of finding generalized paths in tournaments
• Locally semicomplete digraphs: A generalization of tournaments
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs