메뉴 건너뛰기




Volumn 172, Issue 1-3, 1997, Pages 131-139

Maximum chromatic polynomial of 3-chromatic blocks

Author keywords

[No Author keywords available]

Indexed keywords


EID: 30244515907     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00276-2     Document Type: Article
Times cited : (11)

References (4)
  • 1
    • 0043219152 scopus 로고
    • Minimally 2-connected graphs
    • G.A. Dirac, Minimally 2-connected graphs, J. Reine Angew. Math. 228 (1967) 204-216.
    • (1967) J. Reine Angew. Math. , vol.228 , pp. 204-216
    • Dirac, G.A.1
  • 4
    • 84987592477 scopus 로고
    • Maximum chromatic polynomials of 2-connected graphs
    • I. Tomescu, Maximum chromatic polynomials of 2-connected graphs, J. Graph Theory 18 (1994) 329-336.
    • (1994) J. Graph Theory , vol.18 , pp. 329-336
    • Tomescu, I.1


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