Abstract
We prove that every tournament T with no three disjoint cycles contains a set X of at most four vertices such that T - X is acyclic.
| Original language | English |
|---|---|
| Journal | Journal of Graph Theory |
| Volume | 79 |
| Issue number | 4 |
| Pages (from-to) | 249-266 |
| Number of pages | 17 |
| ISSN | 0364-9024 |
| DOIs | |
| Publication status | Published - 2015 |