On monochromatic paths and monochromatic cycles in edge coloured tournaments
type: Item
instance of: scholarly article
title: On monochromatic paths and monochromatic cycles in edge coloured tournaments
zbMATH Open document ID: 0857.05054
DOI: 10.1016/0012-365X(95)00036-V
author: Hortensia Galeana-Sánchez
published in: Discrete Mathematics
publication date: 1996-10-07T00:00:00Z
review text: The author gives various conditions sufficient to ensure that a tournament whose arcs are \(m\)-coloured has a node \(v\) such that for every other node \(x\) there is a monochromatic path from \(x\) to \(v\). One such condition is that each directed cycle of length at most four is quasi-monochromatic, i.e., with at most one exception its arcs all have the same colour.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 932552
zbMATH Keywords: tournament
zbMATH Keywords: monochromatic path
zbMATH Keywords: cycle
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Q3941433
cites work: Recent problems and results about kernels in directed graphs
cites work: On kernel-perfect critical digraphs
cites work: Cycle-pancyclism in tournaments. III
cites work: On monochromatic paths in edge-coloured digraphs
cites work: On monochromatic paths in m-coloured tournaments
description: scientific article; zbMATH DE number 932552