A Study on List Coloring Problems
碩士 === 國立暨南國際大學 === 資訊工程學系 === 97 === List coloring is to color each vertex v of graph G from its color set L(v). If any two adjacent vertices have different colors, G is colored properly. We are interested in the smallest size of L(v) for every vertex v such that each L(v) has the same size and the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73379001246894658997 |