On list coloring of graphs
碩士 === 國立中央大學 === 數學研究所 === 96 === In this paper we present some results on list coloring and its variants. A Nordhaus-Gaddum type result on choosability with separation s is presented which generalizes a theorem of Erdos, Rubin and Taylor (Congr. Numer. 26 (1979) 125-157). A new graph parameter chg...
Main Authors: | Cheng-Feng Yeh, 葉政峰 |
---|---|
Other Authors: | Hong-Gwa Yeh |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/r7v2kg |
Similar Items
-
List coloring in general graphs
by: Sengupta, Rik
Published: (2017) -
An Introduction to List Colorings of Graphs
by: Baber, Courtney Leigh
Published: (2014) -
On List-Coloring and the Sum List Chromatic Number of Graphs.
by: Hall, Coleman
Published: (2011) -
5-list-coloring graphs on surfaces
by: Postle, Luke Jamison
Published: (2013) -
Graph choosability and double list colorability
by: Hamid-Reza Fanaï
Published: (2010-01-01)