Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Cheng, Panpan Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 1 of 1 reviews    
  Planar graphs without 4-cycles adjacent to triangles are 4-choosable
Cheng P., Chen M., Wang Y. Discrete Mathematics 339(12): 3052-3057, 2016.  Type: Article

Let G be a finite simple graph. A list assignment is a function on the vertices that associates a list of colors with each vertex. An L-coloring is a function that colors each vertex with one of th...
...
Nov 30 2016  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy