메뉴 건너뛰기




Volumn 19, Issue 2, 2005, Pages 281-293

Circular distance two labeling and the λ-number for outerplanar graphs

Author keywords

Circular distance two labeling; Distance two labeling; L(2,1) labeling; Outerplanar graphs

Indexed keywords

CIRCULAR DISTANCE TWO LABELING; DISTANCE TWO LABELING; L(2,1)-LABELING; OUTERPLANAR GRAPHS;

EID: 33646834417     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102414296     Document Type: Article
Times cited : (17)

References (13)
  • 1
    • 34247128977 scopus 로고    scopus 로고
    • Approximations for λ-coloring of graphs
    • manuscript, 2001. An earlier version appeared in STACS 2000, H. Reichel and S. Tichild, eds., Springer-Verlag, Berlin, Heidelberg
    • H. L. BODLAENDER, T. KLOKS, R. B. TAN, AND J. VAN LEEUWEN, Approximations for λ-Coloring of Graphs, manuscript, 2001. An earlier version appeared in STACS 2000, Lecture Notes in Comput Sci. 1770, H. Reichel and S. Tichild, eds., Springer-Verlag, Berlin, Heidelberg, 2000, pp. 395-406.
    • (2000) Lecture Notes in Comput Sci. , vol.1770 , pp. 395-406
    • Bodlaender, H.L.1    Kloks, T.2    Tan, R.B.3    Van Leeuwen, J.4
  • 2
    • 0030367240 scopus 로고    scopus 로고
    • The L(2,1)-labeling problem on graphs
    • G. J. CHANG AND D. Kuo, The L(2,1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
    • (1996) SIAM J. Discrete Math. , vol.9 , pp. 309-316
    • Chang, G.J.1    Kuo, D.2
  • 3
    • 0000801332 scopus 로고
    • Labeling graphs with a condition at distance 2
    • J. R. GRIGGS AND R. YEH, Labeling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
    • (1992) SIAM J. Discrete Math. , vol.5 , pp. 586-595
    • Griggs, J.R.1    Yeh, R.2
  • 4
    • 0019213982 scopus 로고
    • Frequency assignment: Theory and applications
    • W. K. HALE, Frequency assignment: Theory and applications, Proc. IEEE, 68 (1980), pp. 1497-1514.
    • (1980) Proc. IEEE , vol.68 , pp. 1497-1514
    • Hale, W.K.1
  • 6
    • 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), pp. 426-437.
    • (2003) SIAM J. Discrete Math. , vol.16 , pp. 426-437
    • Král, D.1    Škrekovski, R.2
  • 7
    • 0035815451 scopus 로고    scopus 로고
    • Hamiltonicity and circular distance two labellinga
    • D. LIU, Hamiltonicity and circular distance two labellinga, Discrete Math., 232 (2001), pp. 163-169.
    • (2001) Discrete Math. , vol.232 , pp. 163-169
    • Liu, D.1
  • 8
    • 2442636530 scopus 로고    scopus 로고
    • Sizes of graphs with fixed orders and spans for circular-distance-two labeling
    • D. LIU, Sizes of graphs with fixed orders and spans for circular-distance-two labeling, Ars Combin., 67 (2003), pp. 125-139.
    • (2003) Ars Combin. , vol.67 , pp. 125-139
    • Liu, D.1
  • 10
    • 0242319054 scopus 로고    scopus 로고
    • Circular distance two labeling and circular chromatic number
    • D. LIU AND X. ZHU, Circular distance two labeling and circular chromatic number, Ars Cornbin., 69 (2003), pp. 177-183.
    • (2003) Ars Cornbin. , vol.69 , pp. 177-183
    • Liu, D.1    Zhu, X.2
  • 11
    • 0038722910 scopus 로고    scopus 로고
    • Circular colorings of edge-weighted graphs
    • B. MOHAR, Circular colorings of edge-weighted graphs, J. Graph Theory, 43 (2003), pp. 107-116.
    • (2003) J. Graph Theory , vol.43 , pp. 107-116
    • Mohar, B.1
  • 12
    • 20444424483 scopus 로고    scopus 로고
    • A bound on the chromatic number of the square of a planar graph
    • M. MOLLOY AND M. SALAVATIPOUR, A bound on the chromatic number of the square of a planar graph, J. Combin. Theory Ser. B, 94 (2005), pp. 189-213.
    • (2005) J. Combin. Theory Ser. B , vol.94 , pp. 189-213
    • Molloy, M.1    Salavatipour, M.2
  • 13
    • 0000380901 scopus 로고
    • Labeling chordal graphs: Distance two condition
    • D. SAKAI, Labeling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.
    • (1994) SIAM J. Discrete Math. , vol.7 , pp. 133-140
    • Sakai, D.1


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