Loading...

Uniquely 2-list colorable graphs

Ganjali, Y. G ; Sharif University of Technology | 2002

56 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/S0166-218X(00)00335-8
  3. Publisher: 2002
  4. Abstract:
  5. A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way, we generalize a theorem which characterizes uniquely 2-list colorable graphs. We introduce the uniquely list chromatic number of a graph and make a conjecture about it which is a generalization of the well-known Brooks' theorem. © 2002 Elsevier Science B.V
  6. Keywords:
  8. Source: Discrete Applied Mathematics ; Volume 119, Issue 3 , 2002 , Pages 217-225 ; 0166218X (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0166218X00003358