Coloring and Domination of Vertices of Graphs
博士 === 國立臺灣科技大學 === 資訊管理系 === 101 === Let $G$ be a graph with vertex set $V$. A \textbf{list assignment} of a graph $G$ is a function $\mathcal{L}$ which assigns to each $v\in V$ a list $\mathcal{L}(v)$ of colors. A \textbf{list coloring} of $G$ with list assignment $\mathcal{L}$ is a map $c:V\righ...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14874689929139797125 |