Loading...

A uniquely 3-list colorable, planar and k4-free graph

Asadi, S. A ; Sharif University of Technology | 2010

183 Viewed
  1. Type of Document: Article
  2. Publisher: 2010
  3. Abstract:
  4. Let G be a graph with v vertices. If there exists a collection of list of colors S1, S1,..., Sv on its vertices, each of size k, such that there exists a unique proper coloring for G from this list of colors, then G is called a uniquely k-list colorable graph. In this note we present a uniquely 3-list colorable, planar and K4-free Graph. It is a counterexample for a conjecture by Ch. Eslahchi, M. Ghebleh and H. Hajiabolhassan [3]
  5. Keywords:
  6. Free graphs ; Proper coloring ; Uniquely k-list colorable
  7. Source: Journal of Combinatorial Mathematics and Combinatorial Computing ; Volume 72 , 2010 , Pages 115-120 ; 08353026 (ISSN)