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: | Jyun-Wei Huang, 黃俊瑋 |
---|---|
Other Authors: | David Kuo |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/z82zjs |
Similar Items
-
The List-L(2,1)-labeling Problem of Graphs
by: Yu-Ju Chen, et al.
Published: (2004) -
L(2,1)-labeling and List-L(2,1)-labeling of Corona of Two Graphs
by: Hsing-Ju Tsai, et al.
Published: (2006) -
L(p,q)-Labeling of Digraphs
by: Yi-Ting Chen, et al.
Published: (2003) -
The Strong Distance Problem on Some Digraph
by: Chun Ming Huang, et al.
Published: (2003) -
Graceful labeling of digraphs—a survey
by: Shivarajkumar, et al.
Published: (2021-09-01)