Loading...
  1. Simple search
  2. Search result
Search for: uniquely-k-list-colorable
0.005 seconds
Total 1 records

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

      , Article Journal of Combinatorial Mathematics and Combinatorial Computing ; Volume 72 , 2010 , Pages 115-120 ; 08353026 (ISSN) Asadi, S. A ; Sharif University of Technology
      2010
      Abstract
      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]  
    Total 1 records