메뉴 건너뛰기




Volumn 30, Issue 1, 1999, Pages 1-6

Construction of uniquely H-colorable graphs

Author keywords

Constructive proof; Homomorphism; Large odd girth; Uniquely H colorable

Indexed keywords


EID: 0033484068     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199901)30:1<1::AID-JGT1>3.0.CO;2-P     Document Type: Article
Times cited : (16)

References (14)
  • 1
    • 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
  • 3
    • 85034144217 scopus 로고    scopus 로고
    • personal communication
    • Y. Kirsch, personal communication.
    • Kirsch, Y.1
  • 4
    • 0041177146 scopus 로고
    • A hypergraph free construction of highly chromatic graphs without short cycles
    • I. Kříž, A hypergraph free construction of highly chromatic graphs without short cycles, Combinatorica 9 (1989), 227-229.
    • (1989) Combinatorica , vol.9 , pp. 227-229
    • Kříž, I.1
  • 5
    • 0001856099 scopus 로고
    • On chromatic numbers of graphs and set systems
    • L. Lovász, On chromatic numbers of graphs and set systems, Acta Math. Acad. Sci. Hungar. 17 (1966), 61-99.
    • (1966) Acta Math. Acad. Sci. Hungar. , vol.17 , pp. 61-99
    • Lovász, L.1
  • 6
    • 25944461404 scopus 로고
    • On critical uniquely colorable graphs
    • Basel
    • J. Nešetřil, On critical uniquely colorable graphs, Arch. Math. (Basel), 23 (1972), 210-213.
    • (1972) Arch. Math. , vol.23 , pp. 210-213
    • Nešetřil, J.1
  • 7
    • 0040797880 scopus 로고
    • Amalgamation of graphs and its application
    • J. Nešetřil, Amalgamation of graphs and its application, Ann. New York Acad. Sci., 319 (1979), 415-428.
    • (1979) Ann. New York Acad. Sci. , vol.319 , pp. 415-428
    • Nešetřil, J.1
  • 8
    • 0010993026 scopus 로고
    • A short proof of the existence of highly chromatic hypergraphs without short cycles
    • J. Nešetřil and V. Rödl, A short proof of the existence of highly chromatic hypergraphs without short cycles, J. Combin. Theory 27 (1979), 225-227.
    • (1979) J. Combin. Theory , vol.27 , pp. 225-227
    • Nešetřil, J.1    Rödl, V.2
  • 9
    • 0007034895 scopus 로고
    • On uniquely colorable graphs without short cycles
    • J. Nešetřil, On uniquely colorable graphs without short cycles, Casopis Pést. Mat. 98 (1973), 122-125.
    • (1973) Casopis Pést. Mat. , vol.98 , pp. 122-125
    • Nešetřil, J.1
  • 10
    • 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
  • 11
    • 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
  • 12
    • 0040153234 scopus 로고    scopus 로고
    • Some theorems concerning the star chromatic number of a graph
    • B. Zhou, Some theorems concerning the star chromatic number of a graph, J. Comb. Theory (B) 70 (1997), 245-258.
    • (1997) J. Comb. Theory (B) , vol.70 , pp. 245-258
    • Zhou, B.1
  • 13
    • 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
  • 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


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