- Tytuł:
- Detour chromatic numbers
- Autorzy:
-
Frick, Marietjie
Bullock, Frank - Powiązania:
- https://bibliotekanauki.pl/articles/743511.pdf
- Data publikacji:
- 2001
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
detour
generalised chromatic number
longest path
vertex partition
girth
circumference
nearly bipartite - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2001, 21, 2; 283-291
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł