SCOPUS 정보 검색 플랫폼

Volumn 130, Issue 3, 2003, Pages 513-519

No-hole L(2,1)-colorings

Author keywords

Channel assignment problems; Distance two colorings; No hole colorings

Indexed keywords

PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CHANNEL ASSIGNMENT PROBLEMS;

GRAPH THEORY;

EID: 0041418307 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(03)00329-9 Document Type: Article

Times cited : (35)

References (14)

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

2
- 0042599768
- Full color theorems for L(2,1)-colorings
- P.C. Fishburn, F.S. Roberts, Full color theorems for L(2,1) -colorings, DIMACS Technical Report 2000-08, 2000.
- (2000) DIMACS Technical Report , vol.8
- Fishburn, P.C.¹ Roberts, F.S.²

3
- 0043100636
- Minimal forbidden graphs for L(2,1) -colorings
- P.C. Fishburn, F.S. Roberts, Minimal forbidden graphs for L(2,1) -colorings, DIMACS Technical Report 2000-32, 2000.
- (2000) DIMACS Technical Report , vol.32
- Fishburn, P.C.¹ Roberts, F.S.²

4
- 0030555034
- On the size of graphs labeled with a condition at distance two
- Georges J.P., Mauro D.W. On the size of graphs labeled with a condition at distance two. J. Graph Theory. 22:1996;47-57.
- (1996) J. Graph Theory , vol.22 , pp. 47-57
- Georges, J.P.¹ Mauro, D.W.²

5
- 0038580940
- Relating path coverings to vertex labelings with a condition at distance two
- Georges J.P., Mauro D.W., Whittlesey M.A. Relating path coverings 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.P.¹ Mauro, D.W.² Whittlesey, M.A.³

6
- 0000801332
- Labelling graphs with a condition at distance 2
- Griggs J.R., Yeh R.K. Labelling 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.²

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

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

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

10
- 0041597722
- No-hole 2-distant colorings
- Roberts F.S. No-hole 2-distant colorings. Math. Comput. Modelling. 17:1993;139-144.
- (1993) Math. Comput. Modelling , vol.17 , pp. 139-144
- Roberts, F.S.¹

11
- 0000380901
- Labeling chordal graphs: Distance two conditions
- Sakai D. Labeling chordal graphs. distance two conditions SIAM J. Discrete Math. 7:1994;133-140.
- (1994) SIAM J. Discrete Math. , vol.7 , pp. 133-140
- Sakai, D.¹

12
- 38249001072
- No-hole (r+1)-distant colorings
- Sakai D., Wang C. No-hole. (r+1) -distant colorings Discrete Math. 119:1993;175-189.
- (1993) Discrete Math. , vol.119 , pp. 175-189
- Sakai, D.¹ Wang, C.²

13
- 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.³

14
- 0039207420
- Ph.D. Thesis, University of South Carolina, Columbia, SC
- R.K. Yeh, Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina, Columbia, SC, 1990.
- (1990) Labeling Graphs with a Condition at Distance Two
- Yeh, R.K.¹

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