LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES

DOI10.4134/JKMS.2004.41.5.895zbMath1064.05070OpenAlexW2124354159MaRDI QIDQ4673719

Yubao Guo, Ronald J. Gould

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

zbMATH Keywords

strong connectivity

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 (4)

Cycle factors in strongly connected local tournaments ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Locally Semicomplete Digraphs and Generalizations

This page was built for publication: LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES