Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: tight tournament

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

A class of tight circulant tournaments

100%

Galeana-Sánchez H., Neumann-Lara V.

Discussiones Mathematicae Graph Theory

2000

tom 20

nr 1

109-128

A tournament is said to be tight whenever every 3-colouring of its vertices using the 3 colours, leaves at least one cyclic triangle all whose vertices have different colours. In this paper, we extend the class of known tight circulant tournaments.

Infinite families of tight regular tournaments

86%

Llano B., Olsen M.

Discussiones Mathematicae Graph Theory

2007

tom 27

nr 2

299-311

In this paper, we construct infinite families of tight regular tournaments. In particular, we prove that two classes of regular tournaments, tame molds and ample tournaments are tight. We exhibit an infinite family of 3-dichromatic tight tournaments. With this family we positively answer to one case of a conjecture posed by V. Neumann-Lara. Finally, we show that any tournament with a tight mold is also tight.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

1 Galeana-Sánchez H.

1 Llano B.

1 Neumann-Lara V.

1 Olsen M.

1 2007

1 2000

Wyniki wyszukiwania

A class of tight circulant tournaments

Infinite families of tight regular tournaments