1. Sum list coloring graphs;Berliner;Graphs Combin.,2006
2. The interactive sum choice number of graphs;Bonamy,2017
3. Sum-paintability of generalized theta-graphs;Carraher;Graphs Combin.,2015
4. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs, in: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ. Arcata, Calif. 1979) (Winnipeg, Man.), Congress. Numer. XXVI, Utilitas Math. 1980, pp. 125–157. MR 593902 (82f:05038).
5. G. Gutowski, T. Krawczyk, D.B. West, M. Zajac, X. Zhu, Upper bounds for sum-color cost of outerplanar, planar and k-degenerate graphs, preprint.