메뉴 건너뛰기




Volumn 154, Issue 3, 2006, Pages 598-603

The L (2, 1)-labelling of trees

Author keywords

Distance; L(2, 1) labelling; Maximum degree; Tree

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING;

EID: 32144442166     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.09.007     Document Type: Article
Times cited : (40)

References (12)
  • 1
    • 0030367240 scopus 로고    scopus 로고
    • The L(2, 1)-labelling problem on graphs
    • G.J. Chang, and D. Kuo The L(2, 1) -labelling problem on graphs SIAM J. Discrete Math. 9 1996 309 316
    • (1996) SIAM J. Discrete Math. , vol.9 , pp. 309-316
    • Chang, G.J.1    Kuo, D.2
  • 3
    • 0038580940 scopus 로고
    • Relating path coverings to vertex labellings with a condition at distance two
    • J.P. Georges, D.W. Mauro, and M.A. Whittlesey Relating path coverings to vertex labellings with a condition at distance two Discrete Math. 135 1994 103 111
    • (1994) Discrete Math. , vol.135 , pp. 103-111
    • Georges, J.P.1    Mauro, D.W.2    Whittlesey, M.A.3
  • 4
    • 0038580941 scopus 로고    scopus 로고
    • Labeling products of complete graphs with a condition at distance two
    • J.P. Georges, D.W. Mauro, and M.I. Stein Labeling products of complete graphs with a condition at distance two SIAM J. Discrete Math. 14 2000 28 35
    • (2000) SIAM J. Discrete Math. , vol.14 , pp. 28-35
    • Georges, J.P.1    Mauro, D.W.2    Stein, M.I.3
  • 5
    • 0000801332 scopus 로고
    • Labelling graphs with a condition at distance 2
    • J.R. Griggs, and R.K. Yeh 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.1    Yeh, R.K.2
  • 6
    • 0019213982 scopus 로고
    • 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.1
  • 8
    • 0041884948 scopus 로고    scopus 로고
    • A theorem about the channel assignment problem
    • D. Král, and R. Škrekovski A theorem about the channel assignment problem SIAM J. Discrete Math. 16 2003 426 437
    • (2003) SIAM J. Discrete Math. , vol.16 , pp. 426-437
    • Král, D.1    Škrekovski, R.2
  • 9
    • 20444424483 scopus 로고    scopus 로고
    • A bound on the chromatic number of the square of a planar graph
    • M. Molloy, and M.R. Salavatipour A bound on the chromatic number of the square of a planar graph J. Combin. Theory Ser. B 94 2005 189 213
    • (2005) J. Combin. Theory Ser. B , vol.94 , pp. 189-213
    • Molloy, M.1    Salavatipour, M.R.2
  • 10
    • 0000380901 scopus 로고
    • Labelling chordal graphs: Distance two condition
    • D. Sakai Labelling chordal graphs: distance two condition SIAM J. Discrete Math. 7 1994 133 140
    • (1994) SIAM J. Discrete Math. , vol.7 , pp. 133-140
    • Sakai, D.1
  • 11
    • 2542440900 scopus 로고    scopus 로고
    • Labelling planar graphs with conditions on girth and distance two
    • W.F. Wang, and K.W. Lih Labelling planar graphs with conditions on girth and distance two SIAM J. Discrete Math. 17 2 2004 264 275
    • (2004) SIAM J. Discrete Math. , vol.17 , Issue.2 , pp. 264-275
    • Wang, W.F.1    Lih, K.W.2


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