메뉴 건너뛰기




Volumn 13, Issue 3, 1997, Pages 287-294

Chromaticity of chordal graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 27644516101     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03353007     Document Type: Article
Times cited : (2)

References (16)
  • 1
    • 84967632573 scopus 로고
    • Characterization of chromatically rigid polynomials
    • Borodin, O.V., Dmitriev, I.G.: Characterization of chromatically rigid polynomials (in Russian). Sibirsk. Mat. Zh. 32, 22-27 (1991)
    • (1991) Sibirsk. Mat. Zh. , vol.32 , pp. 22-27
    • Borodin, O.V.1    Dmitriev, I.G.2
  • 3
    • 84963088582 scopus 로고
    • A theorem of R.L. Brooks and a conjecture of H. Hadwiger
    • Dirac, G.A.: A theorem of R.L. Brooks and a conjecture of H. Hadwiger. Proc. London Math. Soc. (3)7, 161-195 (1957)
    • (1957) Proc. London Math. Soc. , vol.7 , Issue.3 , pp. 161-195
    • Dirac, G.A.1
  • 5
    • 0039419819 scopus 로고
    • Characterization of the class of k-trees
    • Dmitriev, I.G.: Characterization of the class of k-trees (in Russian). Metody Diskret. Analiz. 28, 9-18 (1982)
    • (1982) Metody Diskret. Analiz. , vol.28 , pp. 9-18
    • Dmitriev, I.G.1
  • 6
    • 0542364150 scopus 로고
    • Some chromatically unique graphs with seven points
    • Frucht, R.W., Giudici, R.E.: Some chromatically unique graphs with seven points. Ars Combinat. 16-A, 161-172 (1983)
    • (1983) Ars Combinat. , vol.16 A , pp. 161-172
    • Frucht, R.W.1    Giudici, R.E.2
  • 7
    • 41549118299 scopus 로고
    • The intersection graphs of subtrees in trees are exactly the chordal graphs
    • Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16, 47-56 (1974)
    • (1974) J. Comb. Theory Ser. B , vol.16 , pp. 47-56
    • Gavril, F.1
  • 8
    • 0040170958 scopus 로고
    • σ-polynomials and graph coloring
    • Korfhage, R.R.: σ-polynomials and graph coloring. J. Comb. Theory Ser. B 24, 137-153 (1978)
    • (1978) J. Comb. Theory Ser. B , vol.24 , pp. 137-153
    • Korfhage, R.R.1
  • 9
    • 0002529522 scopus 로고
    • An introduction to chromatic polynomials
    • Read, R.C.: An introduction to chromatic polynomials. J. Comb. Theory 4, 52-71 (1968)
    • (1968) J. Comb. Theory , vol.4 , pp. 52-71
    • Read, R.C.1
  • 10
    • 85033512437 scopus 로고
    • Review #6906
    • Read, R.C.: Review #6906, Math. Rev. 50, 1975
    • (1975) Math. Rev. , pp. 50
    • Read, R.C.1
  • 11
    • 0002461816 scopus 로고
    • Chromatic Polynomials
    • L.W. Beineke and R.J. Wilson, editor, Academic Press
    • Read, R.C., Tutte, W.T.: Chromatic Polynomials. In: L.W. Beineke and R.J. Wilson, editor, Selected Topics in Graph Theory III 15-42. Academic Press 1988
    • (1988) Selected Topics in Graph Theory , vol.3 , pp. 15-42
    • Read, R.C.1    Tutte, W.T.2
  • 12
    • 84986469498 scopus 로고
    • Chromaticity of triangulated graphs
    • Vaderlind, P.: Chromaticity of triangulated graphs. J. Graph Theory 12, 245-248 (1988)
    • (1988) J. Graph Theory , vol.12 , pp. 245-248
    • Vaderlind, P.1
  • 13
    • 84986533474 scopus 로고
    • On the chromaticity of certain subgraphs of a q-tree
    • Wanner, T.: On the chromaticity of certain subgraphs of a q-tree. J. Graph Theory 13, 597-605 (1989)
    • (1989) J. Graph Theory , vol.13 , pp. 597-605
    • Wanner, T.1
  • 14
    • 84986528159 scopus 로고
    • Chromaticity of two-trees
    • Whitehead, E.G. Jr.,: Chromaticity of two-trees. J. Graph Theory 9, 279-284 (1985)
    • (1985) J. Graph Theory , vol.9 , pp. 279-284
    • Whitehead Jr., E.G.1
  • 16
    • 38249027350 scopus 로고
    • On σ-polynomials
    • Xu, S.-J.: On σ-polynomials. Discrete Math. 69, 189-194 (1988)
    • (1988) Discrete Math. , vol.69 , pp. 189-194
    • Xu, S.-J.1


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