๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Onn-partite Tournaments with Uniquen-cycle

โœ Scribed by Gregory Gutin; Arash Rafiey; Anders Yeo

Book ID
106047591
Publisher
Springer Japan
Year
2006
Tongue
English
Weight
130 KB
Volume
22
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Partitioning Vertices of a Tournament in
Partitioning Vertices of a Tournament into Independent Cycles
โœ Guantao Chen; Ronald J. Gould; Hao Li ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 108 KB

Let k be a positive integer. A strong digraph G is termed k-connected if the removal of any set of fewer than k vertices results in a strongly connected digraph. The purpose of this paper is to show that every k-connected tournament with at least 8k vertices contains k vertex-disjoint directed cycle