Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments

DOI10.1137/0403046zbMath0715.05042OpenAlexW2016868849MaRDI QIDQ3201091

Zsolt Tuza, Yannis Manoussakis

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1137/0403046

zbMATH Keywords

algorithmsbipartite tournamentfinding cyclesfinding Hamiltonian cyclesfinding Hamiltonian paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Cycles through \(k\) vertices in bipartite tournaments ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Cycles and paths in bipartite tournaments with spanning configurations

This page was built for publication: Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments