Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Detour chromatic numbers

Marietjie FrickFrank Bullock — 2001

Discussiones Mathematicae Graph Theory

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.

Page 1

Download Results (CSV)