{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:05:27Z","timestamp":1775635527458,"version":"3.50.1"},"reference-count":18,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":5818,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1990,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It was conjectured by Fan that if a graph <jats:italic>G<\/jats:italic> = (<jats:italic>V,E<\/jats:italic>) has a nowhere\u2010zero 3\u2010flow, then <jats:italic>G<\/jats:italic> can be covered by two even subgraphs of total size at most |<jats:italic>V<\/jats:italic>| + |<jats:italic>E<\/jats:italic>| \u2010 3. This conjecture is proved in this paper. It is also proved in this paper that the optimum solution of the Chinese postman problem and the solution of minimum cycle covering problem are equivalent for any graph admitting a nowhere\u2010zero 4\u2010flow.<\/jats:p>","DOI":"10.1002\/jgt.3190140504","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:51:01Z","timestamp":1180183861000},"page":"537-546","source":"Crossref","is-referenced-by-count":13,"title":["Minimum cycle coverings and integer flows"],"prefix":"10.1002","volume":"14","author":[{"given":"Cun\u2010Quan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0606035"},{"key":"e_1_2_1_3_2","unstructured":"B.Alspach L.Goddyn andC. Q.Zhang Graphs with the circuit cover property TRANS. AMS(submitted)."},{"key":"e_1_2_1_4_2","article-title":"Cycle covering of cubic multigraphs","author":"Alspach B.","journal-title":"J. Combin. Theory B"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90056-4"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580113"},{"key":"e_1_2_1_8_2","unstructured":"G.Fan Integer flows and cycle covers. Preprint."},{"key":"e_1_2_1_9_2","article-title":"Covering weighted graphs by even subgraphs","author":"Fan G.","journal-title":"J. Combinat. Theory B"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90044-9"},{"key":"e_1_2_1_11_2","first-page":"61","article-title":"On the minimum weighted cycle covering problem for planar graphs","volume":"20","author":"Guan M.","year":"1985","journal-title":"Ars Combinat."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08860-1_21"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030110"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(79)90057-1"},{"key":"e_1_2_1_15_2","article-title":"Shortest circuit covers and postman tours in graphs with a nowhere zero 4\u2010flow","author":"Jackson B.","journal-title":"SIAM J. Discrete Math."},{"key":"e_1_2_1_16_2","first-page":"341","volume-title":"Graph Theory and Related Topics","author":"Seymour P. D.","year":"1979"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"P. D.Seymour Matroids and multicommodity flows.Eur. J. Combinat.(1981)257.","DOI":"10.1016\/S0195-6698(81)80033-9"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-51.6.474"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070307"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190140504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190140504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T19:06:02Z","timestamp":1698001562000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190140504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["10.1002\/jgt.3190140504"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190140504","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}