T-choosability in graphs

Discrete Applied Mathematics

Volumn 82, Issue 1-3, 1998, Pages 1-13

  Alon, Noga ^a   Zaks, Ayal ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042624299     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00124-8     Document Type: Article

References (11)

1. N. Alon, Restricted colorings of graphs, in: K. Walker (Ed.), Surveys in Combinatories, 1993, London Mathematical Society Lecture Note Series, vol. 187, Cambridge University Press, Cambridge, 1993, pp. 1-33.
2. N. Alon, M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (2) (1992) 125-134.
3. P. Erdös, A.L. Rubin, H. Taylor, Choosability in graphs, Congr. Numer. 26 (1979) 125-157.
4. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
5. A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1977) 99-118.
6. A.K. Mackworth, Constraint Satisfaction, in: S.C. Shapiro, D. Eckroth (Eds.), Encyclopedia of Artificial Intelligence, vol. 1, Wiley, New York, 1987, pp. 205-211.
7. F.S. Roberts, T-colorings of graphs: recent results and open problems, Discrete Math. 93 (1991) 229-245.
8. B.A. Tesman, T-colorings, list T-colorings, and set T-colorings of graphs, Ph.D. Thesis. Department of Mathematics, Rutgers University New Brunswick, NJ, October 1989.
9. B.A. Tesman, List T-colorings of graphs, Discrete Appl. Math. 45 (1993) 277-289.
10. V.G. Vizing, Colouring the vertices of a graph in prescribed colours (in Russian), Diskret. Analiz. No. 29, Metody Diskret. Anal. v. Teorii Kodiv i Shem 101 (1976) 3-10. (MR58#16371).
11. A. Zaks, Restricted vertex-colorings of graphs in frequency assignment problems, M Sc. Thesis, Tel Aviv University (1996).