1. Cameron, K., Eschen, E.M., Hoang, C.T., Sritharan, R.: The list partition problem for graphs. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, pp. 391–399 (2004)
2. Cornen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2001)
3. Lipski, W.: Kombinatoryka dla programistów. WNT, Warszawa (1982)
4. Rajasekaran, S., Lee, I.: Parallel algorithms for relational coarsest partition problems. IEEE Trans. Parallel Distributed Systems 9(7), 687–699 (1998)
5. Thanh, H.C.: Combinatorics. VNUH Press (1999) (in Vietnamese)