Bounded vertex coloring of trees

Discrete Mathematics

Volumn 232, Issue 1-3, 2001, Pages 145-151

  Jarvis, Mark ^a   Zhou, Bing ^a  

^a TRENT UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035815404     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00345-9     Document Type: Article

References (5)

1. H.L. Bodlaender, K. Jansen, On the Complexity of Scheduling Incompatible Jobs with Unit-times, in: A.M. Borzyskowski, S. Sokolowski (Eds.), Lecture Notes in Computer Science, Vol 711: Mathematical Foundations of Computer Science, 1993, pp. 291-300, Springer, Berlin.
2. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, New York, 1976.
3. D. de Werra, Restricted coloring models for timetabling, Discrete Math. 165/166 (1997) 161-170.
4. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, New York, 1979.
5. P. Hanson, A. Hertz, J. Kuplinsky, Bounded vertex colorings of graphs, Discrete Math. 111 (1993) 305-312.