{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:38Z","timestamp":1753893818626,"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>In 1995, Paul Erd\u00f6s and Andr\u00e1s Gy\u00e1rf\u00e1s conjectured that for every graph of minimum degree at least 3, there exists a non-negative integer $m$ such that $G$ contains a simple cycle of length $2^m$. In this paper, we prove that the conjecture holds for 3-connected cubic planar graphs. The proof is long, computer-based in parts, and employs the Discharging Method in a novel way.<\/jats:p>","DOI":"10.37236\/3252","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:48:40Z","timestamp":1578707320000},"source":"Crossref","is-referenced-by-count":6,"title":["Erd\u00f6s-Gy\u00e1rf\u00e1s Conjecture for Cubic Planar Graphs"],"prefix":"10.37236","volume":"20","author":[{"given":"Christopher Carl","family":"Heckman","sequence":"first","affiliation":[]},{"given":"Roi","family":"Krakovski","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,4,9]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p7\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i2p7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:22:55Z","timestamp":1579260175000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i2p7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,9]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,4,9]]}},"URL":"https:\/\/doi.org\/10.37236\/3252","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,4,9]]},"article-number":"P7"}}