SCOPUS 정보 검색 플랫폼

Volumn 174, Issue 1-3, 1997, Pages 357-363

Some results on list T-colourings

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041657218 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(96)00349-4 Document Type: Article

Times cited : (3)

References (5)

1
- 0019213982
- Frequency assignment: Theory and applications
- W.K. Hale, Frequency assignment: theory and applications, in: Proc. IEEE 68 (1980) 1497-1514.
- (1980) Proc. IEEE , vol.68 , pp. 1497-1514
- Hale, W.K.¹

2
- 0013110657
- 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.¹

3
- 0000307033
- Choosability in graphs
- A.L. Rubin, P. Erdös and H. Taylor, Choosability in graphs, in: Proc. West Coast Conf. on Combinatorics, Graph Theory, and Computing, Congr. Numer. XXVI (1979) 125-157.
- (1979) Proc. West Coast Conf. on Combinatorics, Graph Theory, and Computing, Congr. Numer. , vol.26 , pp. 125-157
- Rubin, A.L.¹ Erdös, P.² Taylor, H.³

4
- 0040793207
- Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ
- B. Tesman, T-Colorings, List T-colorings, and set T-colorings of graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ, 1989.
- (1989) T-colorings, List T-colorings, and Set T-colorings of Graphs
- Tesman, B.¹

5
- 0041115813
- An upper bound for list T-colourings
- A.O. Waller, An upper bound for list T-colourings, Bull. London Math. Soc. 28 (1996) 337-342.
- (1996) Bull. London Math. Soc. , vol.28 , pp. 337-342
- Waller, A.O.¹

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