Complementary cycles of all lengths in tournaments

DOI10.1006/jctb.1993.1002zbMath0723.05062OpenAlexW1975943028MaRDI QIDQ757404

Zeng Min Song

Publication date: 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1002

zbMATH Keywords

tournamentsvertex-disjoint cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (25)

On complementary cycles in locally semicomplete digraphs ⋮ Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths ⋮ Complementary cycles in regular bipartite tournaments ⋮ Complementary cycles of any length in regular bipartite tournaments ⋮ Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture ⋮ A survey on Hamilton cycles in directed graphs ⋮ Safe sets and in-dominating sets in digraphs ⋮ Complementary cycles in almost regular multipartite tournaments, where one cycle has length four ⋮ Minimum cycle factors in quasi-transitive digraphs ⋮ Multipartite tournaments: a survey ⋮ Componentwise complementary cycles in multipartite tournaments ⋮ Cycle factors in strongly connected local tournaments ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ Three supplements to Reid's theorem in multipartite tournaments ⋮ Finding complementary cycles in locally semicomplete digraphs ⋮ The partition of a strong tournament ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Complementary cycles in irregular multipartite tournaments ⋮ Complementary cycles in regular multipartite tournaments, where one cycle has length five ⋮ Triangle packings and 1-factors in oriented graphs ⋮ All regular multipartite tournaments that are cycle complementary ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Semicomplete Multipartite Digraphs ⋮ Partitioning vertices of a tournament into independent cycles

This page was built for publication: Complementary cycles of all lengths in tournaments