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
 
Discrete Mathematics
Elsevier Science Publishers B. V.
 
   
 
Options:
 
  1-3 of 3 reviews Date Reviewed 
  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
  Sorting a bridge hand
Eriksson H., Eriksson K., Karlander J., Svensson L., Wästlund J. Discrete Mathematics 241(1-3): 289-300, 2001.  Type: Article

The problem of sorting a permutation by transposing blocks (“block moves”) is fundamental to computational biology. Block moves in a permutation model genetic mutations that arise in a string of DNA when sections o...

Oct 29 2002
  Decompositions of positive self-dual Boolean functions
Bioch J., Ibaraki T. Discrete Mathematics 140(1-3): 23-46, 1995.  Type: Article

The authors investigate the decomposition of any positive self-dual Boolean function into smaller positive self-dual functions. This approach is used since it provides understanding of the representation and construction of various non...

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