Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: nearly bipartite

Sortuj według:

Ogranicz wyniki do:

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

Detour chromatic numbers

100%

Frick M., Bullock F.

Discussiones Mathematicae Graph Theory

2001

tom 21

nr 2

283-291

The nth detour chromatic number, χₙ(G) of a graph G is the minimum number of colours required to colour the vertices of G such that no path with more than n vertices is monocoloured. The number of vertices in a longest path of G is denoted by τ( G). We conjecture that χₙ(G) ≤ ⎡(τ(G))/n⎤ for every graph G and every n ≥ 1 and we prove results that support the conjecture. We also present some sufficient conditions for a graph to have nth chromatic number at most 2.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Bullock F.

1 Frick M.

1 2001

Wyniki wyszukiwania

Detour chromatic numbers