메뉴 건너뛰기
Annales de l'Institut Fourier
Volumn 49, Issue 3, 1999, Pages 1089-1093
The graph polynomial and the number of proper vertex colorings
Author keywords

Graph coloring; Graph polynomial
Indexed keywords

EID: 0033410586     PISSN: 03730956     EISSN: None     Source Type: Journal    
DOI: 10.5802/aif.1707     Document Type: Article
Times cited : (3)
References (4)
  • 1
    • 0000576339 scopus 로고
    • Colorings and orientations of graphs
    • N. ALON and M. TARSI, Colorings and orientations of graphs, Combinatorica, 12 (1992), 125-134.
    • (1992) Combinatorica , vol.12 , pp. 125-134
    • Alon, N.1    Tarsi, M.2
  • 2
    • 0039527934 scopus 로고    scopus 로고
    • A note on graph colorings and graph polynomials
    • N. ALON and M. TARSI, A note on graph colorings and graph polynomials, J. Comb. Theory, B 70 (1997), 197-201.
    • (1997) J. Comb. Theory, B , vol.70 , pp. 197-201
    • Alon, N.1    Tarsi, M.2
  • 3
    • 0010931014 scopus 로고
    • A solution to a colouring problem of P. Erdös
    • H. FLEISCHNER and M. STIEBITZ, A solution to a Colouring problem of P. Erdös, Discrete Math., 101 (1992), 39-48.
    • (1992) Discrete Math. , vol.101 , pp. 39-48
    • Fleischner, H.1    Stiebitz, M.2
  • 4
    • 0040119448 scopus 로고
    • Elementary proof of the cycle-plus-triangles theorem
    • Paul Erdös is Eighty, Janos Bolyai Math. Soc., Budapest
    • H. SACHS, Elementary proof of the cycle-plus-triangles theorem, in: Combinatorics, Paul Erdös is Eighty, Janos Bolyai Math. Soc., Budapest, 1993, Vol 1, 347-359.
    • (1993) Combinatorics , vol.1 , pp. 347-359
    • Sachs, H.1

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