메뉴 건너뛰기
Journal of Graph Theory
Volumn 37, Issue 1, 2001, Pages 48-77
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
Author keywords

Bipartite graphs; Chromatic equivalence; Chromatic polynomials; Chromatic uniqueness
Indexed keywords

EID: 33751338999     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.1003     Document Type: Article
Times cited : (24)
References (14)
  • 1
    • 38249007545 scopus 로고
    • Classes of chromatically unique graphs
    • M. Borowiecki and E. Drgas-Burchardt, Classes of chromatically unique graphs, Discrete Math 111 (1993), 71-75.
    • (1993) Discrete Math , vol.111 , pp. 71-75
    • Borowiecki, M.1    Drgas-Burchardt, E.2
  • 2
    • 0041355811 scopus 로고    scopus 로고
    • Some families of chromatically unique bipartite graphs
    • X. Chen, Some families of chromatically unique bipartite graphs, Discrete Math 184 (1998), 245-253.
    • (1998) Discrete Math , vol.184 , pp. 245-253
    • Chen, X.1
  • 3
    • 84987505502 scopus 로고
    • On chromatic uniqueness of two infinite families of graphs
    • F. M. Dong, On chromatic uniqueness of two infinite families of graphs, J Graph Theory 17 (1993), 387-392.
    • (1993) J Graph Theory , vol.17 , pp. 387-392
    • Dong, F.M.1
  • 4
    • 0041787418 scopus 로고
    • Chromatic uniqueness of certain bipartite graphs
    • R. E. Giudici and E. Lima de Sá, Chromatic uniqueness of certain bipartite graphs, Congr Numer 76 (1990), 69-75.
    • (1990) Congr Numer , vol.76 , pp. 69-75
    • Giudici, R.E.1    De Lima Sá, E.2
  • 5
    • 1842617119 scopus 로고
    • The number of shortest cycles and the chromatic uniqueness of a graph
    • K. M. Koh and C. P. Teo, The number of shortest cycles and the chromatic uniqueness of a graph, J Graph Theory 16 (1992), 7-15.
    • (1992) J Graph Theory , vol.16 , pp. 7-15
    • Koh, K.M.1    Teo, C.P.2
  • 6
    • 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
  • 7
    • 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
  • 8
    • 0041337218 scopus 로고
    • Chromatic uniqueness of certain bipartite graphs
    • Y. H. Peng, Chromatic uniqueness of certain bipartite graphs, Discrete Math 94 (1991), 129-140.
    • (1991) Discrete Math , vol.94 , pp. 129-140
    • Peng, Y.H.1
  • 9
    • 0002461816 scopus 로고
    • Chromatic polynomials
    • L. W. Beineke and R. J. Wilson, (Editors), Academic Press, New York
    • R. C. Read and W. T. Tutte, "Chromatic polynomials," Selected Topics in Graph Theory III, L. W. Beineke and R. J. Wilson, (Editors), Academic Press, New York, 1988, pp. 15-42.
    • (1988) Selected Topics in Graph Theory III , pp. 15-42
    • Read, R.C.1    Tutte, W.T.2
  • 10
    • 0043290580 scopus 로고
    • On the chromatic uniqueness of bipartite graphs
    • P. M. Salzberg, M. A. Lopez, and R. E. Giudici, On the chromatic uniqueness of bipartite graphs, Discrete Math 58 (1986), 285-294.
    • (1986) Discrete Math , vol.58 , pp. 285-294
    • Salzberg, P.M.1    Lopez, M.A.2    Giudici, R.E.3
  • 11
    • 0041337291 scopus 로고
    • The chromaticity of complete bipartite graphs with at most one edge deleted
    • C. P. Teo and K. M. Koh, The chromaticity of complete bipartite graphs with at most one edge deleted, J Graph Theory 14 (1990), 89-99.
    • (1990) J Graph Theory , vol.14 , pp. 89-99
    • Teo, C.P.1    Koh, K.M.2
  • 12
    • 84986435757 scopus 로고
    • On 3-colourings of bipartite p-threshold graphs
    • I. Tomescu, On 3-colourings of bipartite p-threshold graphs, J Graph Theory 11(3) (1987), 327-338.
    • (1987) J Graph Theory , vol.11 , Issue.3 , pp. 327-338
    • Tomescu, I.1
  • 13
    • 30244537959 scopus 로고
    • The chromatic uniqueness of complete bipartite graphs
    • S. Xu, The chromatic uniqueness of complete bipartite graphs, Discrete Math 94 (1991), 153-159.
    • (1991) Discrete Math , vol.94 , pp. 153-159
    • Xu, S.1
  • 14
    • 33751306929 scopus 로고
    • Corrigendum
    • S. Xu, Corrigendum, Discrete Math 104 (1992), 217.
    • (1992) Discrete Math , vol.104 , pp. 217
    • Xu, S.1

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