{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:16Z","timestamp":1759063696987,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A graph is $f$-choosable if for every collection of lists with list sizes specified by $f$ there is a proper coloring using colors from the lists. The sum choice number is the minimum over all choosable functions $f$ of the sum of the sizes in $f$. We show that the sum choice number of a $2 \\times n$ array (equivalent to list edge coloring $K_{2,n}$ and to list vertex coloring the cartesian product $K_2 \\square K_n$) is $n^2 + \\lceil 5n\/3 \\rceil$.<\/jats:p>","DOI":"10.37236\/1669","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:25:50Z","timestamp":1578709550000},"source":"Crossref","is-referenced-by-count":15,"title":["Sum List Coloring $2 \\times n$  Arrays"],"prefix":"10.37236","volume":"9","author":[{"given":"Garth","family":"Isaak","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2002,5,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1n8\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1n8\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:14:36Z","timestamp":1579324476000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v9i1n8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5,7]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2002,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1669","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2002,5,7]]},"article-number":"N8"}}