메뉴 건너뛰기
Bulletin of the London Mathematical Society
Volumn 28, Issue 4, 1996, Pages 337-342
An upper bound for list T-colourings
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0041115813     PISSN: 00246093     EISSN: None     Source Type: Journal    
DOI: 10.1112/blms/28.4.337     Document Type: Article
Times cited : (4)
References (5)
  • 1
    • 0000307033 scopus 로고
    • Choosability in graphs
    • Proc. West Coast Conf. on Combinatorics, Graph Theory, and Computing
    • P. ERDOS, A. L. RUBIN and H. TAYLOR, 'Choosability in graphs', 'Proc. West Coast Conf. on Combinatorics, Graph Theory, and Computing', Congr. Numer. 26 (1979) 125-157.
    • (1979) Congr. Numer. , vol.26 , pp. 125-157
    • Erdos, P.1    Rubin, A.L.2    Taylor, H.3
  • 2
    • 0019213982 scopus 로고
    • Frequency assignment: Theory and applications
    • W. K. HALE, 'Frequency assignment: theory and applications', Proc. IEEE (1980) 1497-1514.
    • (1980) Proc. IEEE , pp. 1497-1514
    • Hale, W.K.1
  • 3
    • 0013110657 scopus 로고
    • T-colorings of graphs: Recent results and open problems
    • F. S. ROBERTS, 'T-colorings of graphs: recent results and open problems', Discrete Math. 93 (1991) 229-245.
    • (1991) Discrete Math. , vol.93 , pp. 229-245
    • Roberts, F.S.1
  • 5
    • 0002221232 scopus 로고
    • Colouring the vertices of a graph in prescribed colours
    • Diskret. Analiz. No. 29
    • V. G. VIZING, 'Colouring the vertices of a graph in prescribed colours' (Russian), Diskret. Analiz. No. 29, Metody Diskret. Analiz. Teorii Kodov Shem 101 (1976) 3-10.
    • (1976) Metody Diskret. Analiz. Teorii Kodov Shem , vol.101 , pp. 3-10
    • Vizing, V.G.1

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