Circular colorings and acyclic choosability of graphs
博士 === 國立中山大學 === 應用數學系研究所 === 98 === Abstract: This thesis studies five kinds of graph colorings: the circular coloring, the total coloring, the (d; 1)-total labeling, the circular (r; 1)-total labeling, and the acyclic list coloring. We give upper bounds on the circular chromatic number of graphs...
Main Authors: | Nicolas Roussel, 盧賽爾 |
---|---|
Other Authors: | André Raspaud |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/18684723073324507189 |
Similar Items
-
Circular coloring and acyclic choosability of graphs
by: Roussel, Nicolas
Published: (2009) -
Graph choosability and double list colorability
by: Hamid-Reza Fanaï
Published: (2010-01-01) -
Weight Choosability of Graphs
by: Chun-Yen Kuo, et al.
Published: (2013) -
On Choosability and Paintability of Graphs
Published: (2015) -
Weight Choosability of theta Graphs
by: Ting-Feng Jian, et al.
Published: (2014)