Cycle factors in strongly connected local tournaments

DOI10.1016/J.DISC.2009.09.025zbMath1215.05079OpenAlexW1997206487MaRDI QIDQ965966

Dirk Meierling, Lutz Volkmann

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

zbMATH Keywords

complementary cycleslocal tournamentcycle factorcut vertices

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

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

This page was built for publication: Cycle factors in strongly connected local tournaments