LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES

DOI10.4134/JKMS.2004.41.5.895MaRDI QIDQ4673719zbMATH OpenOpenAlexFDO

Authors Ronald Gould, Yubao Guo

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

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

Recommendations

• Finding complementary cycles in locally semicomplete digraphs
• On complementary cycles in locally semicomplete digraphs
• A note on spanning local tournaments in locally semicomplete digraphs
• scientific article; zbMATH DE number 871182
• scientific article; zbMATH DE number 804599

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673719)