On complementary cycles in locally semicomplete digraphs
From MaRDI portal
Publication:1343256
DOI10.1016/0012-365X(93)E0099-PzbMath0816.05036MaRDI QIDQ1343256
Publication date: 1 February 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Minimum cycle factors in quasi-transitive digraphs, Cycle factors in strongly connected local tournaments, Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, A classification of locally semicomplete digraphs, Path-connectivity in local tournaments, Finding complementary cycles in locally semicomplete digraphs, All regular multipartite tournaments that are cycle complementary, All 2-connected in-tournaments that are cycle complementary
Cites Work