Elsevier

Discrete Applied Mathematics

Volume 200, 19 February 2016, Pages 191-199
Discrete Applied Mathematics

Fractional Thue chromatic number of graphs

https://doi.org/10.1016/j.dam.2015.06.026Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper introduces the concept of the fractional Thue chromatic number of graphs and studies the relation between the fractional Thue chromatic number and the Thue chromatic number. We determine the fractional Thue chromatic number of all paths, all trees with no vertices of degree two, and all cycles, except C10, C14, C17. As a consequence, we prove that if G is a path or a tree with no degree two vertices, then its fractional Thue chromatic number equals its Thue chromatic number. On the other hand, we show that there are trees and cycles whose fractional Thue chromatic numbers are strictly less than their Thue chromatic numbers.

Keywords

Thue chromatic number
Fractional Thue chromatic number
Non-repetitive colouring

Cited by (0)