Loading...

Unique list-colourability and the fixing chromatic number of graphs [electronic resource]

Daneshgar, A. (Amir) ; Sharif University of Technology

398 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.dam.2005.04.006
  3. Abstract:
  4. In this paper we introduce a chromatic parameter, called the fixing chromatic number, which is related to unique colourability of graphs, in the sense that it measures how one can embed the given graph G in G∪Kt by adding edges between G and Kt to make the whole graph uniquely t-colourable. We study some basic properties of this parameter as well as its relationships to some other well-known chromatic numbers as the acyclic chromatic number. We compute the fixing chromatic number of some graph products by applying a modified version of the exponential graph construction
  5. Keywords:
  6. Uniquely list-colourable graphs ; Fixing numberl ; Fixing chromatic number ; Exponential graph construction
  7. Source: Discrete Applied Mathematics ; Volume 152, Issues 1–3, 1 November 2005, Pages 123–138
  8. URL: https://www.researchgate.net/publication/220567649_Unique_list-colourability_and_the_fixing_chromatic_number_of_graphs