Name
Abstract | ||
|---|---|---|
For any positive integer n, we find all disconnected digraphs G of size at most four, such that a transitive tournament of order n is G-decomposable. It follows that the obvious necessary condition of divisibility is not always sufficient. |
Year | Venue | DocType |
|---|---|---|
2007 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
37 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Agnieszka Görlich | 1 | 27 | 9.19 |
| Rafal Kalinowski | 2 | 0 | 0.34 |
| Mariusz Meszka | 3 | 30 | 16.21 |
| Monika Pilśniak | 4 | 28 | 9.31 |
| Mariusz Wozniak | 5 | 111 | 19.51 |