메뉴 건너뛰기




Volumn 15, Issue , 2004, Pages 237-246

On Colorings of Squares of Outerplanar Graphs

Author keywords

[No Author keywords available]

Indexed keywords

CHROMATIC NUMBERS; GRAPH NOTATIONS; OPTIMAL COLORING;

EID: 1842435928     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (17)
  • 1
    • 0038580844 scopus 로고
    • Graphs with given diameter and a coloring problem
    • University of Dortmund
    • G. Wegner. Graphs with given diameter and a coloring problem. Technical report, University of Dortmund, 1977.
    • (1977) Technical Report
    • Wegner, G.1
  • 7
    • 0020787246 scopus 로고
    • On Powers and Centers of Chordal Graphs
    • R. Laskar and D. Shier. On Powers and Centers of Chordal Graphs, Discrete Applied Mathematics, 6:139-147, 1983.
    • (1983) Discrete Applied Mathematics , vol.6 , pp. 139-147
    • Laskar, R.1    Shier, D.2
  • 9
    • 0002529522 scopus 로고
    • An Introduction to Chromatic Polynomials
    • R. C. Read. An Introduction to Chromatic Polynomials, J. of Combinatorial Theory, 4, 52-71, 1968.
    • (1968) J. of Combinatorial Theory , vol.4 , pp. 52-71
    • Read, R.C.1
  • 13
    • 0001294529 scopus 로고    scopus 로고
    • A linear-time algorithm for finding tree-decompositions of small treewidth
    • H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6):1305-1317, 1996.
    • (1996) SIAM J. Comput. , vol.25 , Issue.6 , pp. 1305-1317
    • Bodlaender, H.L.1
  • 14
    • 1842498452 scopus 로고    scopus 로고
    • Approximation algorithms for channel assignment in radio networks
    • S. O. Krumke, M. V. Marathe, and S. S. Ravi. Approximation algorithms for channel assignment in radio networks. Dial M for Mobility, 1998.
    • (1998) Dial M for Mobility
    • Krumke, S.O.1    Marathe, M.V.2    Ravi, S.S.3
  • 15
    • 0033722049 scopus 로고    scopus 로고
    • Generalized vertex-colorings of partial k-trees
    • X. Zhou, Y. Kanari, and T. Nishizeki. Generalized vertex-colorings of partial k-trees. IEICE Trans. Fundamentals, E83-A:671-678, 2000.
    • (2000) IEICE Trans. Fundamentals , vol.E83-A , pp. 671-678
    • Zhou, X.1    Kanari, Y.2    Nishizeki, T.3
  • 16
    • 1842446241 scopus 로고    scopus 로고
    • A bound on the chromatic number of the square of a planar graph
    • Earlier version appears in ESA
    • M. Molloy and M. R. Salavatipour. A bound on the chromatic number of the square of a planar graph. At CiteSeer. Earlier version appears in ESA 2001.
    • (2001) CiteSeer
    • Molloy, M.1    Salavatipour, M.R.2


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