Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: rainbow-connected graph

Sortuj według:

Ogranicz wyniki do:

Rainbow Connection In Sparse Graphs

100%

Kemnitz A., Przybyło J., Schiermeyer I., Woźniak M.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 1

181-192

An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours. The rainbow connection number of G, denoted by rc(G), is the minimum number of colours such that G is rainbow-connected. In this paper we prove that rc(G) ≤ k if |V (G)| = n and for all integers n and k with n − 6 ≤ k ≤ n − 3. We also show that this bound is tight.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Kemnitz A.

1 Przybyło J.

1 Schiermeyer I.

1 Woźniak M.

1 2013

Wyniki wyszukiwania

Rainbow Connection In Sparse Graphs