dc.contributor.author |
Rojas-Monroy, R |
|
dc.contributor.author |
Galeana-Sánchez, H |
|
dc.date.accessioned |
2011-01-22T10:26:30Z |
|
dc.date.available |
2011-01-22T10:26:30Z |
|
dc.date.issued |
2005 |
|
dc.identifier.issn |
0911-0119 |
|
dc.identifier.uri |
http://hdl.handle.net/11154/3204 |
|
dc.description.abstract |
We call the tournament T an m-coloured tournament if the arcs of T are coloured with m-colours. If v is a vertex of an m- coloured tournament T, we denote by xi(v) the set of colours assigned to the arcs with v as an endpoint. In this paper is proved that if T is an m- coloured tournament with |xi(v)| <= 2 for each vertex v of T, and T satisfies at least one of the two following properties ( 1) m not equal 3 or ( 2) m = 3 and T contains no C-3 ( the directed cycle of length 3 whose arcs are coloured with three distinct colours). Then there is a vertex v of T such that for every other vertex x of T, there is a monochromatic directed path from x to v. |
en_US |
dc.language.iso |
en |
en_US |
dc.title |
Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments |
en_US |
dc.type |
Article |
en_US |
dc.identifier.idprometeo |
1525 |
|
dc.identifier.doi |
10.1007/s00373-005-0618-z |
|
dc.source.novolpages |
21(3):307-317 |
|
dc.subject.wos |
Mathematics |
|
dc.description.index |
WoS: SCI, SSCI o AHCI |
|
dc.subject.keywords |
kernel |
|
dc.subject.keywords |
kernel-perfect digraph |
|
dc.subject.keywords |
kernel by monochromatic paths |
|
dc.subject.keywords |
tournament |
|
dc.subject.keywords |
m-coloured tournament |
|
dc.relation.journal |
Graphs and Combinatorics |
|