Loading...

Unique list-colourability and the fixing chromatic number of graphs

Daneshgar, A ; Sharif University of Technology | 2005

209 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.dam.2005.04.006
  3. Publisher: 2005
  4. Abstract:
  5. 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. © 2005 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Color ; Edge detection ; Embedded systems ; Parameter estimation ; Chromatic number of graphs ; Exponential graph construction ; Fixing chromatic number ; Fixing numbrl ; Uniquely list colorable graph ; Graph theory
  8. Source: Discrete Applied Mathematics ; Volume 152, Issue 1-3 , 2005 , Pages 123-138 ; 0166218X (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0166218X05001010