{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:12:21Z","timestamp":1757542341445,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The Four Color Theorem states that every planar graph is properly 4-colorable. Moreover, it is well known that there are planar graphs that are non-$4$-list colorable. In this paper we investigate a problem combining proper colorings and list colorings. We ask whether the vertex set of every planar graph can be partitioned into two subsets where one subset induces a bipartite graph and the other subset induces a $2$-list colorable graph. We answer this question in the negative strengthening the result on non-$4$-list colorable planar graphs.<\/jats:p>","DOI":"10.37236\/7320","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:24:15Z","timestamp":1578669855000},"source":"Crossref","is-referenced-by-count":6,"title":["A Note on Not-4-List Colorable Planar Graphs"],"prefix":"10.37236","volume":"25","author":[{"given":"Margit","family":"Voigt","sequence":"first","affiliation":[]},{"given":"Arnfried","family":"Kemnitz","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,6,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p46\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p46\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:31:44Z","timestamp":1579235504000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i2p46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,8]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/7320","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,6,8]]},"article-number":"P2.46"}}