{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:29:02Z","timestamp":1770478142091,"version":"3.49.0"},"reference-count":8,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6608,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1988,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We apply proof techniques developed by L. Lov\u00e1sz and A. Frank to obtain several results on the arc\u2010connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or digraph in such a way as to preserve local connectivity conditions. The final result is concerned with orienting the edges of a mixed graph (consisting of vertices, undirected edges, and directed arcs) in such a way that the resulting digraph is as arc\u2010connected as possible.<\/jats:p>","DOI":"10.1002\/jgt.3190120314","type":"journal-article","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T02:56:35Z","timestamp":1181357795000},"page":"429-436","source":"Crossref","is-referenced-by-count":31,"title":["Some remarks on Arc\u2010connectivity, vertex splitting, and orientation in graphs and digraphs"],"prefix":"10.1002","volume":"12","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70734-9"},{"key":"e_1_2_1_3_2","first-page":"17","volume-title":"Selected Topics in Graph Theory 2","author":"Fleischner H.","year":"1983"},{"key":"e_1_2_1_4_2","first-page":"97","article-title":"An algorithm for submodular functions on graphs","volume":"16","author":"Frank A.","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/B978-0-12-566780-7.50015-5","volume-title":"Progress in Combinatorial Optimization","author":"Frank A.","year":"1984"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01902503"},{"key":"e_1_2_1_7_2","volume-title":"Advances in Graph Theory, Annals of Discrete Mathematics 3","author":"Mader W.","year":"1978"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(82)80009-7"},{"key":"e_1_2_1_9_2","volume-title":"Recent Progress in Combinatorics","author":"Nash\u2010Williams C. St. J. A.","year":"1969"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190120314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190120314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T05:43:25Z","timestamp":1695793405000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190120314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["10.1002\/jgt.3190120314"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190120314","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}