메뉴 건너뛰기
Results in Mathematics
Volumn 33, Issue 1-2, 1998, Pages 87-88
Bounds to the Chromatic Polynomial of a Graph
Author keywords

bound; chromatic polynomial; colouring; girth
Indexed keywords

EID: 4644268126     PISSN: 14226383     EISSN: 14209012     Source Type: Journal    
DOI: 10.1007/BF03322072     Document Type: Article
Times cited : (6)
References (4)
  • 1
    • 0002741878 scopus 로고
    • A determinant formula for the number of ways of coloring a map
    • G. D. Birkhoff, A determinant formula for the number of ways of coloring a map. Ann. Math. 14 (1912), 42–46.
    • (1912) Ann. Math. , vol.14 , pp. 42-46
    • Birkhoff, G.D.1
  • 2
    • 0346905978 scopus 로고
    • A Contribution to the Chromatic Theory of Uniform Hypergraphs
    • K. Dohmen, A Contribution to the Chromatic Theory of Uniform Hypergraphs, Result. Math. 28 (1995), 49–52.
    • (1995) Result. Math. , vol.28 , pp. 49-52
    • Dohmen, K.1
  • 3
    • 0039140326 scopus 로고
    • Lower Bounds and Upper Bounds for Chromatic Polynomials
    • K. Dohmen, Lower Bounds and Upper Bounds for Chromatic Polynomials, J. Graph Theory 17 (1993), 75–80.
    • (1993) J. Graph Theory , vol.17 , pp. 75-80
    • Dohmen, K.1
  • 4
    • 0002461816 scopus 로고
    • Chromatic Polynomials
    • R. C. Read and W. T. Tutte,. In:, (eds., L.W., Beineke, &, R. J., Wilson,), Academic Press, New York
    • R. C. Read and W. T. Tutte, Chromatic Polynomials. In: Selected Topics in Graph Theory III (eds. L.W. Beineke & R. J. Wilson), Academic Press, New York (1988), 15–42.
    • (1988) Selected Topics in Graph Theory III , pp. 15-42

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