Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles

DOI10.1002/jgt.21830zbMath1316.05052OpenAlexW1918893063MaRDI QIDQ5265333

Stéphane Bessy, Jörgen Bang-Jensen

Publication date: 23 July 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21830

zbMATH Keywords

tournamentscycle transversaldisjoint cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Transversal (matching) theory (05D15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Packing directed circuits
• On the capacity of digraphs
• Partitioning vertices of a tournament into independent cycles
• Cycles in digraphs– a survey
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• A Problem on Tournaments
• Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
• Digraphs
• On Subtournaments of a Tournament

This page was built for publication: Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles