{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:58:12Z","timestamp":1703195892488},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1007\/bf02579302","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:20:25Z","timestamp":1174602025000},"page":"255-263","source":"Crossref","is-referenced-by-count":12,"title":["Directed cut transversal packing for source-sink connected graphs"],"prefix":"10.1007","volume":"7","author":[{"given":"P.","family":"Feofiloff","sequence":"first","affiliation":[]},{"given":"D. H.","family":"Younger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579302_CR1","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds, Edge-disjoint branchings, in:Combinatorial Algorithms, (R. Rustin, ed.) Algorithmics Press, New York, 1973, 91\u201396."},{"key":"BF02579302_CR2","doi-asserted-by":"crossref","unstructured":"J. Edmonds andR. Giles, A min-max relation for submodular functions on graphs,in: Studies in integer programming (P. L. Hammer, et al, eds.) Annals of Discrete Math.1 (1977), 185\u2013204.","DOI":"10.1016\/S0167-5060(08)70734-9"},{"key":"BF02579302_CR3","first-page":"135","volume-title":"Theory of Graphs","author":"R. P. Gupta","year":"1967","unstructured":"R. P. Gupta, A decomposition theorem for bipartite graphs, in:Theory of Graphs (P. Rosenstiehl, ed.) Gordon and Breach, New York, 1967, 135\u2013138."},{"key":"BF02579302_CR4","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","volume":"21","author":"L. Lov\u00e1sz","year":"1976","unstructured":"L. Lov\u00e1sz, On two minimax theorems in graph theory,J. Combinatorial Theory (B) 21 (1976), 96\u2013103.","journal-title":"J. Combinatorial Theory (B)"},{"key":"BF02579302_CR5","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C. L. Lucchesi","year":"1978","unstructured":"C. L. Lucchesi andD. H. Younger, A minimax relation for directed graphs,J. London Math. Soc. (2) 17 (1978), 369\u2013374.","journal-title":"J. London Math. Soc. (2)"},{"key":"BF02579302_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(80)90057-6","volume":"32","author":"A. Schrijver","year":"1980","unstructured":"A. Schrijver, A counterexample to a conjecture of Edmonds and Giles,Discrete Math. 32 (1980), 213\u2013214.","journal-title":"Discrete Math."},{"key":"BF02579302_CR7","first-page":"261","volume":"16","author":"A. Schrijver","year":"1982","unstructured":"A. Schrijver, Min-max relations for directed graphs,Annals of Discrete Math. 16 (1982), 261\u2013280.","journal-title":"Annals of Discrete Math."},{"key":"BF02579302_CR8","doi-asserted-by":"crossref","unstructured":"D. R. Woodall, Menger and K\u00f6nig systems,in: Theory and Applications of Graphs (Proceedings of the Western Michigan Graph Theory Conference 1976) Springer-Verlag Lecture Notes in Math.642 (1978), 620\u2013635.","DOI":"10.1007\/BFb0070416"},{"key":"BF02579302_CR9","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1111\/j.1749-6632.1979.tb32836.x","volume":"319","author":"D. H. Younger","year":"1979","unstructured":"D. H. Younger, From shortest paths to directed cut transversals,Annals of the New York Academy of Sciences,319 (1979), 555\u2013564.","journal-title":"Annals of the New York Academy of Sciences"},{"key":"BF02579302_CR10","unstructured":"D. H. Younger, Maximum families of disjoint directed cut sets,in: Recent Progress in Combinatorics (W. T. Tutte, ed.) Academic Press, 1969, 329\u2013333."},{"key":"BF02579302_CR11","unstructured":"P. Feofiloff,Disjoint Transversals of Directed Coboundaries, Ph. D. Thesis, University of Waterloo, 1983."},{"key":"BF02579302_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"P. D. Seymour","year":"1977","unstructured":"P. D. Seymour, The matroids with the max-flow min-cut property,J. Combinatorial Theory (B) 23 (1977), 189\u2013222.","journal-title":"J. Combinatorial Theory (B)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579302.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579302\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:01Z","timestamp":1558197901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["BF02579302"],"URL":"https:\/\/doi.org\/10.1007\/bf02579302","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}