LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
From MaRDI portal
Publication:4673719
DOI10.4134/JKMS.2004.41.5.895zbMath1064.05070MaRDI QIDQ4673719
Publication date: 9 May 2005
Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4134/jkms.2004.41.5.895
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Cycle factors in strongly connected local tournaments, Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, All 2-connected in-tournaments that are cycle complementary, Locally Semicomplete Digraphs and Generalizations