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: | Hsu-Ling Liu, 劉旭玲 |
---|---|
Other Authors: | Justie Su-Tzu Juan |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/73379001246894658997 |
Similar Items
-
On list coloring of graphs
by: Cheng-Feng Yeh, et al.
Published: (2008) -
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
by: Sun Lin, et al.
Published: (2020-11-01) -
On List-Coloring and the Sum List Chromatic Number of Graphs.
by: Hall, Coleman
Published: (2011) -
List coloring in general graphs
by: Sengupta, Rik
Published: (2017) -
An Introduction to List Colorings of Graphs
by: Baber, Courtney Leigh
Published: (2014)