Cycles through \(k\) vertices in bipartite tournaments

DOI10.1007/BF01215353zbMath0812.05023OpenAlexW2028461736MaRDI QIDQ1330800

Yannis Manoussakis, Jörgen Bang-Jensen

Publication date: 11 August 1994

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01215353

zbMATH Keywords

cyclebipartite tournament

Mathematics Subject Classification ID

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

Related Items (3)

On \(k\)-strong and \(k\)-cyclic digraphs ⋮ Multipartite tournaments: a survey ⋮ Miscellaneous Digraph Classes

Cites Work

• Unnamed Item
• The directed subgraph homeomorphism problem
• Highly connected non-2-linked digraphs
• Cycles and paths in bipartite tournaments with spanning configurations
• Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

This page was built for publication: Cycles through \(k\) vertices in bipartite tournaments