The List-L(2,1)-labeling Problem of Digraphs
碩士 === 國立東華大學 === 應用數學系 === 95 === Given a graph $G$ with $n$ vertices and a function $L:V(G) ightarrow2^{% %TCIMACRO{U{2115} }% %BeginExpansion mathbb{N} %EndExpansion }$, let $A_{L}= igcuplimits_{vin V(G)}L(v),$ we say that $L$ is $(2,1)$ extit{-choosable for }$G$ if there exists a function $c:Im...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/z82zjs |