On Choosability and Paintability of Graphs
abstract: 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 a...
| Other Authors: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2286/R.I.29820 |