# Monochromatic Paths and at Most 2-Coloured Arc Sets in Edge-Coloured Tournaments

@article{GaleanaSnchez2005MonochromaticPA, title={Monochromatic Paths and at Most 2-Coloured Arc Sets in Edge-Coloured Tournaments}, author={Hortensia Galeana-S{\'a}nchez and Roc{\'i}o Rojas-Monroy}, journal={Graphs and Combinatorics}, year={2005}, volume={21}, pages={307-317} }

- Published in Graphs and Combinatorics 2005
DOI:10.1007/s00373-005-0618-z

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 ξ(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 |ξ(v)|≤2 for each vertex v of T, and T satisfies at least one of the two following properties (1) m≠3 or (2) m=3 and T contains no C3 (the directed cycle of length 3 whose arcs are coloured with three… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 18 CITATIONS

## Absorbent sets and kernels by monochromatic directed paths in m-colored tournaments

VIEW 5 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Kernels by Monochromatic Directed Paths in 3-Colored Tournaments and Quasi-Tournaments

VIEW 3 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## A proof of the Erdős-Sands-Sauer-Woodrow conjecture

VIEW 1 EXCERPT

CITES BACKGROUND

## A proof of the Erdős Sands Sauer

VIEW 1 EXCERPT

CITES BACKGROUND

## King-Serf Duo by Monochromatic Paths in k-Edge-Coloured Tournaments

VIEW 1 EXCERPT

CITES BACKGROUND

## Domination in transitive colorings of tournaments

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-8 OF 8 REFERENCES

## On monochromatic paths in m-coloured tournaments

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Kernels in the closure of coloured digraphs

VIEW 1 EXCERPT

## Kernels in edge-colored digraphs

VIEW 1 EXCERPT

## Graphs and hypergraphs

VIEW 1 EXCERPT