Cycle factors in strongly connected local tournaments
From MaRDI portal
Publication:965966
DOI10.1016/j.disc.2009.09.025zbMath1215.05079MaRDI QIDQ965966
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.025
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
05C40: Connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complementary cycles of all lengths in tournaments
- On complementary cycles in locally semicomplete digraphs
- A classification of locally semicomplete digraphs
- The partition of a strong tournament
- Partitioning vertices of a tournament into independent cycles
- Locally semicomplete digraphs: A generalization of tournaments
- LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
- Locally semicomplete digraphs that are complementarym-pancyclic
- On Subtournaments of a Tournament