메뉴 건너뛰기




Volumn 19, Issue 1, 1999, Pages 139-149

Graphs whose circular chromatic number equals the chromatic number

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0040113672     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050050     Document Type: Article
Times cited : (10)

References (21)
  • 1
    • 84987486737 scopus 로고
    • The star chromatic number of a graph
    • H. L. ABBOTT and B. ZHOU: The star chromatic number of a graph, J. Graph Theory, 17 (1993), 349-360.
    • (1993) J. Graph Theory , vol.17 , pp. 349-360
    • Abbott, H.L.1    Zhou, B.2
  • 2
    • 84986435916 scopus 로고
    • A note on the star chromatic number
    • J. A. BONDY and P. HELL: A note on the star chromatic number, J. Graph Theory, 14 (1990), 479-482.
    • (1990) J. Graph Theory , vol.14 , pp. 479-482
    • Bondy, J.A.1    Hell, P.2
  • 4
    • 0032391971 scopus 로고    scopus 로고
    • On (k, d)-colorings and fractional nowhere-zero flows
    • L. A. GODDYN, M. TARSI, and C. Q. ZHANG: On (k, d)-colorings and fractional nowhere-zero flows, J. Graph Theory, 28 (1998), 155-161.
    • (1998) J. Graph Theory , vol.28 , pp. 155-161
    • Goddyn, L.A.1    Tarsi, M.2    Zhang, C.Q.3
  • 5
    • 84987587767 scopus 로고
    • Acyclic graph coloring and the complexity of the star chromatic number
    • D. R. GUICHARD: Acyclic graph coloring and the complexity of the star chromatic number, J. Graph Theory, 17 (1993), 129-134.
    • (1993) J. Graph Theory , vol.17 , pp. 129-134
    • Guichard, D.R.1
  • 6
    • 0000119873 scopus 로고
    • Über eine Konstruktion nicht n-färbbarer Graphen
    • G. HAJÓS: Über eine Konstruktion nicht n-färbbarer Graphen, Wiss. Zeitschrift Univ. Halle, Math.-Nat., 10 (1961), 113-114.
    • (1961) Wiss. Zeitschrift Univ. Halle, Math.-Nat. , vol.10 , pp. 113-114
    • Hajós, G.1
  • 9
    • 0031491441 scopus 로고    scopus 로고
    • Multichromatic numbers, star chromatic numbers and Kneser graphs
    • A. JOHNSON, F. C. HOLROYD and S. STAHL: Multichromatic numbers, star chromatic numbers and Kneser graphs, J. Graph Theory, 26 (1997), 137-145.
    • (1997) J. Graph Theory , vol.26 , pp. 137-145
    • Johnson, A.1    Holroyd, F.C.2    Stahl, S.3
  • 10
    • 0031541654 scopus 로고    scopus 로고
    • The star-chromatic number of planar graphs
    • D. MOSER: The star-chromatic number of planar graphs, J. Graph Theory, 24 (1997), 33-43.
    • (1997) J. Graph Theory , vol.24 , pp. 33-43
    • Moser, D.1
  • 11
    • 0040996905 scopus 로고
    • Graphs whose every independent set has a common neighbour
    • J. PACH: Graphs whose every independent set has a common neighbour, Discrete Math., 37 (1981), 217-228.
    • (1981) Discrete Math. , vol.37 , pp. 217-228
    • Pach, J.1
  • 12
    • 0042997111 scopus 로고    scopus 로고
    • Star chromatic numbers of graphs
    • E. STEFFEN and X. ZHU: Star chromatic numbers of graphs, Combinatorica, 16 (1996), 439-448.
    • (1996) Combinatorica , vol.16 , pp. 439-448
    • Steffen, E.1    Zhu, X.2
  • 13
    • 84986495391 scopus 로고
    • Star chromatic number
    • A. VINCE: Star chromatic number, J. Graph Theory, 12 (1988), 551-559.
    • (1988) J. Graph Theory , vol.12 , pp. 551-559
    • Vince, A.1
  • 14
    • 84987472618 scopus 로고
    • Star chromatic numbers and products of graphs
    • X. ZHU: Star chromatic numbers and products of graphs, J. Graph Theory, 16 (1992), 557-569.
    • (1992) J. Graph Theory , vol.16 , pp. 557-569
    • Zhu, X.1
  • 15
    • 0030500782 scopus 로고    scopus 로고
    • Uniquely H-colorable graphs with large girth
    • X. ZHU: Uniquely H-colorable graphs with large girth, J. Graph Theory, 23 (1996), 33-41.
    • (1996) J. Graph Theory , vol.23 , pp. 33-41
    • Zhu, X.1
  • 16
    • 85086479753 scopus 로고    scopus 로고
    • Construction of uniquely H-colorable graphs
    • to appear
    • X. ZHU: Construction of uniquely H-colorable graphs, J. Graph Theory, to appear.
    • J. Graph Theory
    • Zhu, X.1
  • 18
    • 85086480984 scopus 로고    scopus 로고
    • A simple proof of Moser's theorem
    • to appear
    • X. ZHU: A simple proof of Moser's Theorem, J. Graph Theory, to appear.
    • J. Graph Theory
    • Zhu, X.1
  • 20
    • 0040402626 scopus 로고    scopus 로고
    • preprint, Department of Mathematics, National Sun Yat-sen University
    • X. ZHU: Circular chromatic number and graph minor, preprint, Department of Mathematics, National Sun Yat-sen University, 1997.
    • (1997) Circular Chromatic Number and Graph Minor
    • Zhu, X.1
  • 21
    • 0004331883 scopus 로고    scopus 로고
    • preprint, Department of Mathematics, National Sun Yat-sen University
    • X. ZHU: Circular chromatic number, a survey, preprint, Department of Mathematics, National Sun Yat-sen University, 1997.
    • (1997) Circular Chromatic Number, a Survey
    • Zhu, X.1


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