{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:17Z","timestamp":1720640837662},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80113-1","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"15-18","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Problems concerning global connectivity of directed graphs"],"prefix":"10.1016","volume":"5","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80113-1_BIB1","series-title":"Digraphs, Theory, Algorithms and Applications","first-page":"770","author":"Bang-Jensen","year":"2000"},{"key":"10.1016\/S1571-0653(05)80113-1_BIB2","unstructured":"J. Bang-Jensen, J. Huang and A. Yeo, Finding small k-arc-strong spanning subdigraphs in k-arc-strong tournaments, submitted."},{"key":"10.1016\/S1571-0653(05)80113-1_BIB3","unstructured":"J. Bang-Jensen, J. Huang and A. Yeo, Strongly connected spanning subgraphs with the minimum number of arcs in quasi-transitive digraphs, submitted."},{"key":"10.1016\/S1571-0653(05)80113-1_BIB4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1017\/S0963548397003179","article-title":"Adding and reversing arcs in semicomplete digraphs","volume":"7","author":"Bang-Jensen","year":"1998","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S1571-0653(05)80113-1_BIB5","unstructured":"J. Bang-Jensen and A. Yeo, Strongly connected spanning subgraphs with the minimum number of arcs in semicomplete multipartite digraphs, submitted."},{"key":"10.1016\/S1571-0653(05)80113-1_BIB6","unstructured":"J. Cheriyan and R. Thurimella, Approximating minimum size k-connected spanning subgraphs via matching, SIAM J. Computing, to appear."},{"key":"10.1016\/S1571-0653(05)80113-1_BIB7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","article-title":"On the orientation of graphs","volume":"28","author":"Frank","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S1571-0653(05)80113-1_BIB8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jctb.1995.1044","article-title":"Minimal edge-coverings of pairs of sets","volume":"65","author":"Frank","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S1571-0653(05)80113-1_BIB9","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jgt.3190120314","article-title":"Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs","volume":"12","author":"Jackson","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(05)80113-1_BIB10","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1137\/S0097539793256685","article-title":"Approximating the minimum equivalent digraph","volume":"24","author":"Khuller","year":"1995","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S1571-0653(05)80113-1_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0166-218X(95)00105-Z","article-title":"On strongly connected digraphs with bounded cycle length","author":"Khuller","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1571-0653(05)80113-1_BIB12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","article-title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph","volume":"7","author":"Nagamochi","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S1571-0653(05)80113-1_BIB13","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1111\/j.1749-6632.1989.tb22479.x","article-title":"Configurations in graphs of large minimum degree, connectivity, or chromatic number","volume":"555","author":"Thomassen","year":"1989","journal-title":"Annals of the New York Academy of Sciences"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:58:03Z","timestamp":1548514683000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":13,"alternative-id":["S1571065305801131"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80113-1","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}