#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2001

2003

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stéphan Ceroi
- Order
- 2003

- Stéphan Ceroi, Frédéric Havet
- Discrete Applied Mathematics
- 2001

We prove that every tree of order n 5 with three leaves is (n + 1)-unavoidable. More precisely, we prove that every tree A with three leaves of order n is contained in every tournament T of order n + 1 except if (T ; A) is (R 5 ; S + 3) or its dual, where R 5 is the regular tournament on ve vertices and S + 3 is the outstar of degree three, that is, the… (More)

- Jean-Claude Bermond, Stéphan Ceroi
- Networks
- 2003

- Stéphan Ceroi
- Electronic Notes in Discrete Mathematics
- 2001

- Pierre Manches, Stéphan Ceroi
- Eur. J. Comb.
- 2002

- ‹
- 1
- ›