{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:34:23Z","timestamp":1774370063740,"version":"3.50.1"},"reference-count":5,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9803,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1979,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Berge conjectured that every finite simple 4\u2010regular graph <jats:italic>G<\/jats:italic> contains a 3\u2010regular subgraph. We prove that this conjecture is true if the cyclic edge connectivity \u03bb<jats:sup><jats:italic>c<\/jats:italic><\/jats:sup>(<jats:italic>G<\/jats:italic>) of <jats:italic>G<\/jats:italic> is at least 10. Also we prove that if <jats:italic>G<\/jats:italic> is a smallest counterexample, then \u03bb<jats:sup><jats:italic>c<\/jats:italic><\/jats:sup>(<jats:italic>G<\/jats:italic>) is either 6 or 8.<\/jats:p>","DOI":"10.1002\/jgt.3190030408","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:21:02Z","timestamp":1180419662000},"page":"371-386","source":"Crossref","is-referenced-by-count":19,"title":["Three\u2010regular subgraphs of four\u2010regular graphs"],"prefix":"10.1002","volume":"3","author":[{"given":"V.","family":"Chv\u00e1tal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Fleischner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Sheehan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Thomassen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Extremal Graph Theory","author":"Bollob\u00e1s B.","year":"1978"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_4_2","first-page":"3","volume-title":"Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing","author":"Erd\u00f6s P.","year":"1975"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-22.2.107"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190030408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190030408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:24:04Z","timestamp":1699781044000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190030408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["10.1002\/jgt.3190030408"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190030408","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}