Partitioning vertices of a tournament into independent cycles
From MaRDI portal
Publication:1850562
DOI10.1006/jctb.2001.2048zbMath1028.05038OpenAlexW2046194500MaRDI QIDQ1850562
Hao Li, Ronald J. Gould, Guantao Chen
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0e351c0c18c840f5be03878444fdf597e228f52b
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (18)
On disjoint cycles of the same length in tournaments ⋮ Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths ⋮ Complementary cycles in regular bipartite tournaments ⋮ Lichiardopol's conjecture on disjoint cycles in 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 ⋮ Cycles in a tournament with pairwise zero, one or two given vertices in common ⋮ Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree ⋮ Cycle factors in strongly connected local tournaments ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ The partition of a strong tournament ⋮ On 1-factors with prescribed lengths in tournaments ⋮ 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 ⋮ Two proofs of Bermond-Thomassen conjecture for regular tournaments ⋮ Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
Cites Work
This page was built for publication: Partitioning vertices of a tournament into independent cycles
