On the n-Partite Tournaments with Exactly n − m + 1 Cycles of Length m
Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (2006) 17–21] raised the following two problems: (1) Let m ∈ {3, 4, . . ., n}. Find a characterization of strong n-partite tournaments having exactly n − m + 1 cycles of length m; (2) Let 3 ≤ m ≤ n and n...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2021-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2167 |