Skip to main content

ASU Electronic Theses and Dissertations

This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.

In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.

Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at

Let $G=(V,E)$ be a graph. A \emph{list assignment} $L$ for $G$ is a function from $V$ to subsets of the natural numbers. An $L$-\emph{coloring} is a function $f$ with domain $V$ such that $f(v)\in L(v)$ for all vertices $v\in V$ and $f(x)\ne f(y)$ whenever $xy\in E$. If $|L(v)|=t$ for all $v\in V$ then $L$ is a $t$-\emph{list assignment}. The graph $G$ is $t$-choosable if for every $t$-list assignment $L$ there is an $L$-coloring. The least $t$ such that $G$ is $t$-choosable is called the list chromatic number of $G$, and is denoted by $\ch(G)$. The complete multipartite graph with $k$ …

Wang, Ran, Kierstead, H.A., Colbourn, Charles, et al.
Created Date