Author:
Giaro Krzysztof,Janczewski Robert,Małafiejski Michał
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. M.O. Albertson, Generalized Colorings, Academic Press, New York, 1987, pp. 35–49.
2. M. Bellare, O. Goldreich, M. Sudan, Free bits, PCP and non-approximability towards tight results, Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, Los Alamos, 1995, pp. 422–431.
3. T-colorings of graphs and the channel assignment problem;Cozzens;Congr. Numer.,1982
4. Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them;Cozzens;J. Combin. Inform. System Sci.,1991
5. Homomorphisms of graphs into odd cycles;Gerards;J. Graph Theory,1988
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献