zbMATH — the first resource for mathematics

The partition of a strong tournament. (English) Zbl 1069.05037
The paper presents some conditions on a strong tournament that cannot be partitioned into two cycles. It also shows that under certain conditions a strong tournament can be partitioned into two cycles. A sufficient condition is also given for a tournament to be partitionable into \(k\) cycles.

05C20 Directed graphs (digraphs), tournaments
05C75 Structural characterization of families of graphs
Full Text: DOI
[1] Bondy, J.A.; Murty, U.S.R., Graph theory with applications, (1976), Macmillan London and New York · Zbl 1134.05001
[2] Guantao Chen, Ronald J. Gould, Hao Li, Partitioning vertices of a tournament into independent cycles, J. Combin. Theory (B) 83 (2001) 213-220. · Zbl 1028.05038
[3] K.B. Reid, Two complementary circuits in two-connected tournaments, in: B.R. Alspach, C.D. Godsil (Eds.), Cycles in Graphs, Annal of Discrete Mathematics, vol. 27, 1985, pp. 321-334. · Zbl 0573.05031
[4] Zengmin Song, Complementary cycles of all lengths in tournaments, J. Combin. Theory (B) 57 (1993) 18-25. · Zbl 0723.05062
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.