메뉴 건너뛰기
Discrete Mathematics
Volumn 176, Issue 1-3, 1997, Pages 97-113
On the structure and chromaticity of graphs in which any two colour classes induce a tree
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0040759262     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00289-0     Document Type: Article
Times cited : (5)
References (16)
  • 4
    • 38249016620 scopus 로고
    • The chromaticity of wheels with a missing spoke
    • G.L. Chia, The chromaticity of wheels with a missing spoke, Discrete Math. 82 (1990) 209-212.
    • (1990) Discrete Math. , vol.82 , pp. 209-212
    • Chia, G.L.1
  • 5
    • 84987589444 scopus 로고
    • On the join of graphs and chromatic uniqueness
    • G.L. Chia, On the join of graphs and chromatic uniqueness, J. Graph Theory 19 (1995) 251-261.
    • (1995) J. Graph Theory , vol.19 , pp. 251-261
    • Chia, G.L.1
  • 7
    • 0001545537 scopus 로고
    • On the number of complete subgraphs contained in certain graphs
    • P. Erdös, On the number of complete subgraphs contained in certain graphs, Publ. Math. Inst. Hung. Acad. Sci. 7 (1962) 459-464.
    • (1962) Publ. Math. Inst. Hung. Acad. Sci. , vol.7 , pp. 459-464
    • Erdös, P.1
  • 8
    • 84986437324 scopus 로고
    • Lower bounds on the number of triangles in a graph
    • D.C. Fisher, Lower bounds on the number of triangles in a graph, J. Graph Theory 13 (1989) 505-512.
    • (1989) J. Graph Theory , vol.13 , pp. 505-512
    • Fisher, D.C.1
  • 9
    • 84967391226 scopus 로고
    • k-trees
    • Chinese, English summary
    • k-trees (Chinese, English summary), Acta Math. Appl. Sinica 11 (1988) 457-467.
    • (1988) Acta Math. Appl. Sinica , vol.11 , pp. 457-467
    • Han, B.T.1
  • 10
    • 0002576202 scopus 로고
    • The search for chromatically unique graphs
    • K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990) 259-285.
    • (1990) Graphs Combin. , vol.6 , pp. 259-285
    • Koh, K.M.1    Teo, K.L.2
  • 11
    • 0002576204 scopus 로고    scopus 로고
    • The search for chromatically unique graphs II
    • K.M. Koh and K.L. Teo, The search for chromatically unique graphs II, Discrete Math. 172 (1997) 59-78.
    • (1997) Discrete Math. , vol.172 , pp. 59-78
    • Koh, K.M.1    Teo, K.L.2
  • 12
    • 0040624560 scopus 로고
    • On complete subgraphs of a graph II
    • L. Lovàsz and M. Simonovits, On complete subgraphs of a graph II, Stud. Pure Math. (1983) 459-496.
    • (1983) Stud. Pure Math. , pp. 459-496
    • Lovàsz, L.1    Simonovits, M.2
  • 13
    • 0002461816 scopus 로고
    • Chromatic polynomials
    • Academic Press, New York
    • R.C. Read and W.T. Tutte, Chromatic polynomials, in: Selected Topics in Graph Theory, vol. 3 (Academic Press, New York, 1988) 15-42.
    • (1988) Selected Topics in Graph Theory , vol.3 , pp. 15-42
    • Read, R.C.1    Tutte, W.T.2
  • 14
    • 0039439202 scopus 로고
    • Chromatic uniqueness of k-trees
    • Dept. of Math., Univ. of Stockholm
    • P. Vaderlind, Chromatic uniqueness of k-trees, Report No. 9, Dept. of Math., Univ. of Stockholm, 1986.
    • (1986) Report , vol.9
    • Vaderlind, P.1
  • 15
    • 6244228084 scopus 로고
    • A logic expansion in mathematics
    • H. Whitney, A logic expansion in mathematics. Bull. Amer. Math. Soc. 38 (1932) 572-579.
    • (1932) Bull. Amer. Math. Soc. , vol.38 , pp. 572-579
    • Whitney, H.1
  • 16
    • 0038846441 scopus 로고
    • The chromaticity of wheels
    • S.-J. Xu and N.-Z. Li, The chromaticity of wheels, Discrete Math. 51 (1984) 207-212.
    • (1984) Discrete Math. , vol.51 , pp. 207-212
    • Xu, S.-J.1    Li, N.-Z.2

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