Journal article
Tournaments and colouring
- Abstract:
- A tournament is a complete graph with its edges directed, and colouring a tournament means partitioning its vertex set into transitive subtournaments. For some tournaments H there exists c such that every tournament not containing H as a subtournament has chromatic number at most c (we call such a tournament H a hero); for instance, all tournaments with at most four vertices are heroes. In this paper we explicitly describe all heroes. © 2012 Elsevier Inc.
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1016/j.jctb.2012.08.003
Authors
- Journal:
- JOURNAL OF COMBINATORIAL THEORY SERIES B More from this journal
- Volume:
- 103
- Issue:
- 1
- Pages:
- 1-20
- Publication date:
- 2013-01-01
- DOI:
- EISSN:
-
1096-0902
- ISSN:
-
0095-8956
- Language:
-
English
- Keywords:
- Pubs id:
-
pubs:371154
- UUID:
-
uuid:8b6a4186-5bab-4c3e-9e4f-37ed3bac0113
- Local pid:
-
pubs:371154
- Source identifiers:
-
371154
- Deposit date:
-
2013-11-17
- ARK identifier:
Terms of use
- Copyright date:
- 2013
If you are the owner of this record, you can report an update to it here: Report update to this record