Antidirected Hamiltonian paths between specified vertices of a tournament

DOI10.1016/S0166-218X(01)00197-4zbMath0996.05062OpenAlexW2025257509WikidataQ128012444 ScholiaQ128012444MaRDI QIDQ1348380

Moshe Rosenfeld, Pavol Hell

Publication date: 15 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00197-4

zbMATH Keywords

polynomial time algorithmtournamentantidirected Hamiltonian path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Ore conditions for antistrong digraphs ⋮ Antidirected Hamiltonian paths and cycles of digraphs with \(\alpha_2\)-stable number 2 ⋮ Anti-Eulerian digraphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian-connected tournaments
• Antidirected Hamiltonian circuits in tournaments
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Antidirected Hamilton circuits and paths in tournaments
• The complexity of finding generalized paths in tournaments
• Paths and Cycles in Tournaments
• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: Antidirected Hamiltonian paths between specified vertices of a tournament