메뉴 건너뛰기




Volumn 30, Issue 4, 1999, Pages 245-259

Distance graphs with missing multiples in the distance sets

Author keywords

Chromatic number; Distance graph; Fractional chromatic number; Precoloring method

Indexed keywords


EID: 0039009603     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199904)30:4<245::AID-JGT1>3.0.CO;2-S     Document Type: Article
Times cited : (21)

References (20)
  • 1
    • 0032388886 scopus 로고    scopus 로고
    • Circular chromatic numbers and fractional chromatic numbers of distance graphs
    • G.J. Chang, L. Huang, and X. Zhu, Circular chromatic numbers and fractional chromatic numbers of distance graphs, Europ J Comb, 19 (1998), 423-431.
    • (1998) Europ J Comb , vol.19 , pp. 423-431
    • Chang, G.J.1    Huang, L.2    Zhu, X.3
  • 4
    • 0039422175 scopus 로고    scopus 로고
    • The chromatic number of distance graphs
    • W. Deuber and X. Zhu, The chromatic number of distance graphs, Disc Math 165/166 (1997), 195-204.
    • (1997) Disc Math , vol.165-166 , pp. 195-204
    • Deuber, W.1    Zhu, X.2
  • 8
    • 0039422173 scopus 로고
    • Update information on research problem 77
    • R.B. Eggleton, P. Erdos, and D.K. Skilton, Update information on research problem 77, Disc Math. 69 (1988), 105.
    • (1988) Disc Math. , vol.69 , pp. 105
    • Eggleton, R.B.1    Erdos, P.2    Skilton, D.K.3
  • 10
    • 0002512840 scopus 로고
    • The channel assignment problem for mutually adjacent sites
    • J.R. Griggs and D.D.-F. Liu, The channel assignment problem for mutually adjacent sites, J Comb Theory Series A, 68 (1994), 169-183.
    • (1994) J Comb Theory Series A , vol.68 , pp. 169-183
    • Griggs, J.R.1    Liu, D.D.-F.2
  • 11
    • 0346811457 scopus 로고    scopus 로고
    • Circular chromatic number of distance graphs with distance set missing multiples
    • to appear
    • L. Huang and G.J. Chang, Circular chromatic number of distance graphs with distance set missing multiples, Europ J Comb, to appear.
    • Europ J Comb
    • Huang, L.1    Chang, G.J.2
  • 12
    • 0040223109 scopus 로고    scopus 로고
    • Coloring of integer distance graphs
    • A. Kemnitz and H. Kolberg, Coloring of integer distance graphs, Disc Math, 191 (1998), 113-123.
    • (1998) Disc Math , vol.191 , pp. 113-123
    • Kemnitz, A.1    Kolberg, H.2
  • 13
    • 85030056270 scopus 로고    scopus 로고
    • T-coloring and chromatic number of distance graphs
    • to appear
    • D.D.-F. Liu, T-coloring and chromatic number of distance graphs, Ars Comb, to appear.
    • Ars Comb
    • Liu, D.D.-F.1
  • 15
    • 0347806730 scopus 로고    scopus 로고
    • Coloring of distance graphs
    • to appear
    • M. Voigt, Coloring of distance graphs, Ars Comb, to appear.
    • Ars Comb
    • Voigt, M.1
  • 16
    • 38149147869 scopus 로고
    • Chromatic number of prime distance graphs
    • M. Voigt and H. Walther, Chromatic number of prime distance graphs, Disc Appl Math 51 (1994), 197-209.
    • (1994) Disc Appl Math , vol.51 , pp. 197-209
    • Voigt, M.1    Walther, H.2
  • 18
    • 0009297230 scopus 로고    scopus 로고
    • Pattern-periodic coloring of distance graphs
    • X. Zhu, Pattern-periodic coloring of distance graphs, J Comb Theory Series B 73 (1998), 195-206.
    • (1998) J Comb Theory Series B , vol.73 , pp. 195-206
    • Zhu, X.1


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