메뉴 건너뛰기
Discrete Mathematics
Volumn 172, Issue 1-3, 1997, Pages 115-119
Chromatic polynomials with least coefficients
Author keywords

[No Author keywords available]
Indexed keywords

EID: 30244503993     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00274-9     Document Type: Article
Times cited : (3)
References (4)
  • 1
    • 0025519023 scopus 로고
    • Least reliable networks and the reliability domination
    • F. Boesch, A. Satyanarayana and C. Suffel, Least reliable networks and the reliability domination, IEEE Trans. Comm. 38 (1990) 2004-2009.
    • (1990) IEEE Trans. Comm. , vol.38 , pp. 2004-2009
    • Boesch, F.1    Satyanarayana, A.2    Suffel, C.3
  • 2
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading, MA
    • F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969).
    • (1969) Graph Theory
    • Harary, F.1
  • 3
    • 84987480148 scopus 로고
    • Graphs with least number of colorings
    • A. Sakaloglu and A. Satyanarayana, Graphs with least number of colorings, J. Graph Theory 19 (1995) 523-533.
    • (1995) J. Graph Theory , vol.19 , pp. 523-533
    • Sakaloglu, A.1    Satyanarayana, A.2
  • 4
    • 0000192604 scopus 로고
    • Acyclic orientations of graphs
    • R. Stanley, Acyclic orientations of graphs, Discrete Math. 5 (1973) 171-178.
    • (1973) Discrete Math. , vol.5 , pp. 171-178
    • Stanley, R.1

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