{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:47:14Z","timestamp":1649202434749},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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,6]]},"DOI":"10.1007\/bf02579449","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:10:40Z","timestamp":1174583440000},"page":"193-204","source":"Crossref","is-referenced-by-count":5,"title":["On switching paths polyhedra"],"prefix":"10.1007","volume":"7","author":[{"given":"H.","family":"Gr\u00f6flin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579449_CR1","volume-title":"Polyhedral and algorithmic ramifications of antichains","author":"K. B. Cameron","year":"1982","unstructured":"K. B. Cameron, Polyhedral and algorithmic ramifications of antichainsPh. D. Thesis (1982) Univ. of Waterloo, Waterloo, Ontario, Canada."},{"key":"BF02579449_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth, A decomposition theorem for partially ordered sets,Ann. of Math. 51 (1950), 161\u2013166.","journal-title":"Ann. of Math."},{"key":"BF02579449_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds andR. Giles, A min-max relation for submodular functions on graphs, (in: Studies in Integer Programming),Ann. of Discrete Math. 1 (1977), 185\u2013204.","journal-title":"Ann. of Discrete Math."},{"key":"BF02579449_CR4","first-page":"181","volume":"21","author":"T. Gallai","year":"1960","unstructured":"T. Gallai andA. N. Milgram, Verallgemeinerung eines graphentheoretischen Satzes von R\u00e9dei,Acta Sc. Math. 21 (1960), 181\u2013186.","journal-title":"Acta Sc. Math."},{"key":"BF02579449_CR5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0097-3165(76)90079-0","volume":"20","author":"C. Greene","year":"1976","unstructured":"C. Greene andD. Kleitman, The structure of Spernerk-families,J. Combinatorial Theory Ser. A 20 (1976), 80\u201388.","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"BF02579449_CR6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02579138","volume":"4","author":"H. Gr\u00f6flin","year":"1984","unstructured":"H. Gr\u00f6flin, Path-closed sets,Combinatorica 4 (1984), 281\u2013290.","journal-title":"Combinatorica"},{"key":"BF02579449_CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02579175","volume":"1","author":"H. Gr\u00f6flin","year":"1981","unstructured":"H. Gr\u00f6flin andA. J. Hoffman, On matroid intersection,Combinatorica 1 (1981), 43\u201347.","journal-title":"Combinatorica"},{"key":"BF02579449_CR8","first-page":"189","volume":"15","author":"H. Gr\u00f6flin","year":"1982","unstructured":"H. Gr\u00f6flin andA. J. Hoffman, Lattice polyhedra II: generalization, constructions and examples,Ann. of Discrete Math. 15 (1982), 189\u2013203.","journal-title":"Ann. of Discrete Math."},{"key":"BF02579449_CR9","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"A. J. Hoffman","year":"1974","unstructured":"A. J. Hoffman, A generalization of max flow-min cut,Mathematical Programming 6 (1974), 352\u2013359.","journal-title":"Mathematical Programming"},{"key":"BF02579449_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0095-8956(77)90052-1","volume":"23","author":"A. J. Hoffman","year":"1977","unstructured":"A. J. Hoffman andD. E. Schwartz, On partitions of a partially ordered set,J. Combinatorial Theory Ser. B 23 (1977), 3\u201313.","journal-title":"J. Combinatorial Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579449.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579449\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:04Z","timestamp":1558183504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02579449"],"URL":"https:\/\/doi.org\/10.1007\/bf02579449","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}