SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Mathematics

Volumn 220, Issue 1-3, 2000, Pages 57-66

On L(d, 1)-labelings of graphs

(5) Chang, Gérard J a Ke, Wen Tsai b Kuo, David c Liu, Daphne D F d Yeh, Roger K e

a NATIONAL CHIAO TUNG UNIVERSITY (Taiwan)

b LING TUNG UNIVERSITY (Taiwan)

c NATIONAL DONG HWA UNIVERSITY (Taiwan)

d CALIFORNIA STATE UNIVERSITY (United States)

e FENG CHIA UNIVERSITY (Taiwan)

Author keywords

Channel assignment problem; Distance two labeling; L(2, 1) labeling; Vertex coloring

Indexed keywords

EID: 0012824969 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(99)00400-8 Document Type: Article

Times cited : (133)

References (15)

1
- 0030367240
- The L(2, 1)-labeling problem on graphs
- G.J. Chang, D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Disc. Math. 9 (1996) 309-316.
- (1996) SIAM J. Disc. Math. , vol.9 , pp. 309-316
- Chang, G.J.¹ Kuo, D.²

2
- 0000431068
- The k-domination and k-stability problem on sun-free chordal graphs
- G.J. Chang, G.L. Nemhauser, The k-domination and k-stability problem on sun-free chordal graphs, SIAM J. Discrete Math. 5 (1984) 332-345.
- (1984) SIAM J. Discrete Math. , vol.5 , pp. 332-345
- Chang, G.J.¹ Nemhauser, G.L.²

3
- 0042265891
- Covering, packing and generalized perfection
- G.J. Chang, G. L. Nemhauser, Covering, packing and generalized perfection, SIAM J. Discrete Math. 6 (1985) 109-132.
- (1985) SIAM J. Discrete Math. , vol.6 , pp. 109-132
- Chang, G.J.¹ Nemhauser, G.L.²

4
- 0004723012
- Characterization of strongly chordal graphs
- M. Farber, Characterization of strongly chordal graphs, Discrete Math. 43 (1983) 173-189.
- (1983) Discrete Math. , vol.43 , pp. 173-189
- Farber, M.¹

5
- 0037566612
- Generalized vertex labelings with a condition at distance two
- J. Georges, D. Mauro, Generalized vertex labelings with a condition at distance two, Congr. Numer. 109 (1995) 141-159.
- (1995) Congr. Numer. , vol.109 , pp. 141-159
- Georges, J.¹ Mauro, D.²

6
- 0038580940
- Relating path covering to vertex labelings with a condition at distance two
- J. Georges, D. Mauro, M. Whittlesey, Relating path covering to vertex labelings with a condition at distance two, Discrete Math. 135 (1994) 103-111.
- (1994) Discrete Math. , vol.135 , pp. 103-111
- Georges, J.¹ Mauro, D.² Whittlesey, M.³

7
- 0003947606
- Academic Press, New York
- M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic, M.C.¹

8
- 0000801332
- Labeling graphs with a condition at distance 2
- J.R. Griggs, R.K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992) 586-595.
- (1992) SIAM J. Discrete Math. , vol.5 , pp. 586-595
- Griggs, J.R.¹ Yeh, R.K.²

9
- 0019213982
- Frequency assignment: Theory and applications
- W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
- (1980) Proc. IEEE , vol.68 , pp. 1497-1514
- Hale, W.K.¹

10
- 0041094481
- Ph.D. Thesis, Dept. of Math., Univ. of South Carolina, Columbia, SC
- K. Jonas, Graph coloring analogues with a condition at distance two: L(2, 1)-labelings and list λ-labelings, Ph.D. Thesis, Dept. of Math., Univ. of South Carolina, Columbia, SC, 1993.
- (1993) Graph Coloring Analogues with a Condition at Distance Two: L(2, 1)-labelings and List λ-labelings
- Jonas, K.¹

11
- 0039907451
- Ph.D. Thesis, Dept. of Applied Math., National Chiao Tung Univ., Hsinchu, Taiwan
- D. Kuo, Graph labeling problems, Ph.D. Thesis, Dept. of Applied Math., National Chiao Tung Univ., Hsinchu, Taiwan, 1995.
- (1995) Graph Labeling Problems
- Kuo, D.¹

12
- 0041111017
- On distance two labellings of graphs
- D. Liu, R.K. Yeh, On distance two labellings of graphs, Ars Combin. 47 (1997) 13-22.
- (1997) Ars Combin. , vol.47 , pp. 13-22
- Liu, D.¹ Yeh, R.K.²

13
- 0346105564
- private communication through J. Griggs
- F.S. Roberts, private communication through J. Griggs, 1988.
- (1988)
- Roberts, F.S.¹

14
- 0000380901
- Labeling chordal graphs with a condition at distance two
- D. Sakai, Labeling chordal graphs with a condition at distance two, SIAM J. Discrete Math. 7 (1994) 133-140.
- (1994) SIAM J. Discrete Math. , vol.7 , pp. 133-140
- Sakai, D.¹

15
- 0038580924
- n and related graphs
- n and related graphs, SIAM J. Discrete Math. 8 (1995) 499-506.
- (1995) SIAM J. Discrete Math. , vol.8 , pp. 499-506
- Whittlesey, M.A.¹ Georges, J.P.² Mauro, D.W.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.