On complementary cycles in locally semicomplete digraphs

DOI10.1016/0012-365X(93)E0099-PzbMath0816.05036WikidataQ126778368 ScholiaQ126778368MaRDI QIDQ1343256

Lutz Volkmann, Yubao Guo

Publication date: 1 February 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complementary cyclestournamentlocally semicomplete digraphsdicycledicycle cover

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)

Related Items (13)

A classification of locally semicomplete digraphs ⋮ Path-connectivity in local tournaments ⋮ Minimum cycle factors in quasi-transitive digraphs ⋮ Weakly cycle complementary 3-partite tournaments ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ Cycle factors in strongly connected local tournaments ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ Finding complementary cycles in locally semicomplete digraphs ⋮ Degree constrained 2-partitions of semicomplete digraphs ⋮ All regular multipartite tournaments that are cycle complementary ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ \(\alpha\)-diperfect digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Complementary cycles of all lengths in tournaments
• On the structure of locally semicomplete digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• On Subtournaments of a Tournament

This page was built for publication: On complementary cycles in locally semicomplete digraphs