Tournaments and colouring
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10128202" target="_blank" >RIV/00216208:11320/13:10128202 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jctb.2012.08.003" target="_blank" >http://dx.doi.org/10.1016/j.jctb.2012.08.003</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2012.08.003" target="_blank" >10.1016/j.jctb.2012.08.003</a>
Alternative languages
Result language
angličtina
Original language name
Tournaments and colouring
Original language description
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. (C) 2012 Elsevier Inc. All rights reserved.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Combinatorial Theory. Series B
ISSN
0095-8956
e-ISSN
—
Volume of the periodical
103
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
20
Pages from-to
1-20
UT code for WoS article
000312038700001
EID of the result in the Scopus database
—