{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:09:51Z","timestamp":1780106991529,"version":"3.54.0"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejc.2026.104395","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T07:20:17Z","timestamp":1778311217000},"page":"104395","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A note on cycles in cyclically 4-edge-connected cubic planar graphs"],"prefix":"10.1016","volume":"136","author":[{"given":"On-Hei Solomon","family":"Lo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2026.104395_b1","series-title":"Infinite and finite sets (Colloq. Keszthely, 1973; Dedicated to P. Erd\u0151s on his 60th birthday)","first-page":"181","article-title":"Pancyclic graphs: recent results","volume":"vol. 10","author":"Bondy","year":"1975"},{"key":"10.1016\/j.ejc.2026.104395_b2","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/j.ejc.2003.04.003","article-title":"Cycles in 4-connected planar graphs","volume":"25","author":"Chen","year":"2004","journal-title":"European J. Combin."},{"issue":"5","key":"10.1016\/j.ejc.2026.104395_b3","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1016\/j.disc.2007.11.059","article-title":"Long cycles in 4-connected planar graphs","volume":"309","author":"Cui","year":"2009","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.ejc.2026.104395_b4","doi-asserted-by":"crossref","first-page":"2039","DOI":"10.1137\/20M1366770","article-title":"Tight gaps in the cycle spectrum of 3-connected planar graphs","volume":"35","author":"Cui","year":"2021","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10.1016\/j.ejc.2026.104395_b5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1006\/eujc.2002.0570","article-title":"Planar graphs without cycles of specific lengths","volume":"23","author":"G.\u00a0Fijav\u017e","year":"2002","journal-title":"European J. Combin."},{"issue":"2","key":"10.1016\/j.ejc.2026.104395_b6","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"theorem\u00a0on graphs","year":"1931","journal-title":"Ann. Math."},{"key":"10.1016\/j.ejc.2026.104395_b7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"theorem on\u00a0planar graphs","year":"1956","journal-title":"Trans. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/j.ejc.2026.104395_b8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/jgt.3190070205","volume":"7","author":"theorem on paths in\u00a0planar graphs","year":"1983","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.ejc.2026.104395_b9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.3190030108","article-title":"On the number of cycles of length k in a maximal planar graph","volume":"3","author":"Hakimi","year":"1979","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.ejc.2026.104395_b10","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/jgt.22712","article-title":"Find subtrees of specified weight and cycles of specified length in linear time","volume":"98","author":"Lo","year":"2021","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.ejc.2026.104395_b11","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1002\/jgt.23152","article-title":"Cycles in 3-connected claw-free planar graphs and 4-connected planar graphs without 4-cycles","volume":"107","author":"Lo","year":"2024","journal-title":"J. Graph Theory"},{"issue":"6","key":"10.1016\/j.ejc.2026.104395_b12","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1007\/s00373-021-02358-x","article-title":"Cycle spectra of contraction-critically 4-connected planar graphs","volume":"37","author":"Lo","year":"2021","journal-title":"Graphs Combin."},{"key":"10.1016\/j.ejc.2026.104395_b13","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jctb.2024.10.002","article-title":"Counting cycles in planar triangulations","volume":"170","author":"Lo","year":"2025","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104395_b14","series-title":"Recent Trends in Graph Theory (Proc. Conf., New York 1970)","first-page":"191","article-title":"On the lengths of cycles in planar graphs","volume":"Vol. 186","author":"Malkevitch","year":"1971"},{"key":"10.1016\/j.ejc.2026.104395_b15","series-title":"Theory and Applications of Graphs (Proc. Conf., Michigan 1976)","first-page":"364","article-title":"Cycle lengths in polytopal graphs","volume":"Vol. 642","author":"Malkevitch","year":"1978"},{"key":"10.1016\/j.ejc.2026.104395_b16","first-page":"169","article-title":"Polytopal graphs","volume":"vol. 3","author":"Malkevitch","year":"1988"},{"key":"10.1016\/j.ejc.2026.104395_b17","series-title":"Infinite and finite sets (Colloq. Keszthely, 1973; Dedicated to P. Erd\u0151s on his 60th birthday)","first-page":"1549","article-title":"Problems","volume":"vol. 10","author":"Plummer","year":"1975"},{"issue":"1","key":"10.1016\/j.ejc.2026.104395_b18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/(SICI)1097-0118(199601)21:1<43::AID-JGT6>3.0.CO;2-M","article-title":"On Hamilton cycles in certain planar graphs","volume":"21","author":"Sanders","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104395_b19","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1006\/jctb.1994.1058","article-title":"4-connected projective-planar graphs are Hamiltonian","volume":"62","author":"Thomas","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"10.1016\/j.ejc.2026.104395_b20","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0893-9659(02)80007-6","article-title":"Choosability and edge choosability of planar graphs without 5-cycles","volume":"15","author":"Wang","year":"2002","journal-title":"Appl. Math. Lett."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000636?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000636?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T01:47:40Z","timestamp":1780105660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":20,"alternative-id":["S0195669826000636"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104395","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A note on cycles in cyclically 4-edge-connected cubic planar graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104395","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104395"}}