{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T18:45:09Z","timestamp":1780339509072,"version":"3.54.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00373-022-02583-y","type":"journal-article","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T16:03:01Z","timestamp":1666022581000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Chords of 2-Factors in Planar Cubic Bridgeless Graphs"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9381-7164","authenticated-orcid":false,"given":"Ajit A.","family":"Diwan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"2583_CR1","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00454-009-9171-5","volume":"42","author":"N Alon","year":"2009","unstructured":"Alon, N., Berke, R., Buchin, K., Buchin, M., Csorba, P., Shannigrahi, S., Speckmann, B., Zumstein, P.: Polychromatic colorings of plane graphs. Discret. Comput. Geom. 42, 421\u2013442 (2009)","journal-title":"Discret. Comput. Geom."},{"key":"2583_CR2","unstructured":"Barnette, D.W.: Conjecture 5. Recent Progress in Combinatorics. In: Tutte, W.T. (ed.) Proceedings of the Third Waterloo Conference on Combinatorics, May 1968, p. 343. Academic Press, New York (1969)"},{"key":"2583_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1006\/jctb.2001.2079","volume":"84","author":"AA Diwan","year":"2002","unstructured":"Diwan, A.A.: Disconnected 2-factors in planar cubic bridgeless graphs. J. Comb. Theory Ser. B 84, 249\u2013259 (2002)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2583_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.37236\/1567","volume":"8","author":"Z Dvo\u0159\u00e1k","year":"2001","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D.: On planar mixed hypergraphs. Electron. J. Comb. 8, 23 (2001)","journal-title":"Electron. J. Comb."},{"key":"2583_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/S0095-8956(02)00031-X","volume":"87","author":"M Funk","year":"2003","unstructured":"Funk, M., Jackson, B., Labbate, D., Sheehan, J.: 2-Factor hamiltonian graphs. J. Comb. Theory Ser. B 87, 138\u2013144 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2583_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.endm.2009.07.032","volume":"34","author":"R H\u00e4ggkvist","year":"2009","unstructured":"H\u00e4ggkvist, R.: Ear decompositions of a cubic bridgeless graph and near $$P_4$$-decompositions of its deck. Electron. Notes Discret. Math. 34, 191\u2013198 (2009)","journal-title":"Electron. Notes Discret. Math."},{"key":"2583_CR7","unstructured":"Hoffmann-Ostenhof, A.: 3-Edge-coloring conjecture. Open problem garden. http:\/\/garden.irmacs.sfu.ca\/op\/3_edge_coloring_conjecture. Accessed 28 Apr 2020"},{"key":"2583_CR8","doi-asserted-by":"publisher","unstructured":"Matsumoto, N., Noguchi, K., Yashima, T.: Cubic graphs having only $$k$$ cycles in each 2-factor. Discuss. Math. Graph Theory. https:\/\/doi.org\/10.7151\/dmgt.2447","DOI":"10.7151\/dmgt.2447"},{"key":"2583_CR9","unstructured":"Penaud, J.G.: Une propri\u00e9t\u00e9 de bicoloration des hypergraphes planaires (in French). In: Colloque sur la Th\u00e9orie des Graphes, Paris, 1974, vol. 17, pp. 345\u2013349. Cahiers Centre \u00c9tudes Recherche Op\u00e9r. Brussels (1975)"},{"key":"2583_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die theorie der regul\u00e4ren graphs. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"2583_CR11","first-page":"51","volume":"7","author":"T Sch\u00f6nberger","year":"1934","unstructured":"Sch\u00f6nberger, T.: Ein Beweis des Petersenschen Graphensatzes. Acta Sci. Math. Szeged 7, 51\u201357 (1934)","journal-title":"Acta Sci. Math. Szeged"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02583-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02583-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02583-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T19:27:46Z","timestamp":1670614066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02583-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2583"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02583-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"27 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"177"}}