{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:08Z","timestamp":1753893848671,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A path coloring\u00a0of a graph $G$ is a vertex coloring of $G$ such that each color class induces a disjoint union of paths. We consider a path-coloring version of list coloring for planar and outerplanar graphs. We show that if each vertex of a planar graph is assigned a list of $3$ colors, then the graph admits a path coloring in which each vertex receives a color from its list. We prove a similar result for outerplanar graphs and lists of size $2$.For outerplanar graphs we prove a multicoloring generalization. We assign each vertex of a graph a list of $q$ colors. We wish to color each vertex with $r$ colors from its list so that, for each color, the set of vertices receiving it induces a disjoint union of paths. We show that we can do this for all outerplanar graphs if and only if $q\/r \\ge 2$. For planar graphs we conjecture that a similar result holds with $q\/r \\ge 3$; we present partial results toward this conjecture.<\/jats:p>","DOI":"10.37236\/7139","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T10:02:07Z","timestamp":1578650527000},"source":"Crossref","is-referenced-by-count":0,"title":["Path Choosability of Planar Graphs"],"prefix":"10.37236","volume":"25","author":[{"given":"Glenn G.","family":"Chappell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Hartman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2018,11,16]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i4p33\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i4p33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:21:33Z","timestamp":1579216893000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i4p33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,16]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,10,5]]}},"URL":"https:\/\/doi.org\/10.37236\/7139","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,11,16]]},"article-number":"P4.33"}}