The List-L(2,1)-labeling Problem of Graphs
碩士 === 國立東華大學 === 應用數學系 === 93 === Given a graph G with n vertices and a function L：V(G) Ν → 2 , we saythat L is (2,1)-choosable for G if there exists a function c : A n i v L i → ≤ ≤ = } 1 ) ( { ζ , i i a v L c = )) ( ( for all i, n i ≤ ≤ 1 , which satisfies the conditions (1) ), ( i i v L a ∈ (2)...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/39879657588900121187 |