乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:37:57Z","timestamp":1648715877466},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1016\/j.ejc.2011.09.046","type":"journal-article","created":{"date-parts":[[2012,9,7]],"date-time":"2012-09-07T16:31:08Z","timestamp":1347035468000},"page":"647-659","source":"Crossref","is-referenced-by-count":0,"title":["Mengerian quasi-graphical families and clutters"],"prefix":"10.1016","volume":"34","author":[{"given":"Nicola","family":"Apollonio","sequence":"first","affiliation":[]},{"given":"Massimiliano","family":"Caramia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2011.09.046_br000005","doi-asserted-by":"crossref","first-page":"4181","DOI":"10.1016\/j.disc.2008.10.004","article-title":"Integrality properties of edge path tree families","volume":"309","author":"Apollonio","year":"2009","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ejc.2011.09.046_br000010","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.orl.2009.05.002","article-title":"A superclass of Edge-Path-Tree graphs with few cliques","volume":"37","author":"Apollonio","year":"2009","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejc.2011.09.046_br000015","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/moor.1100.0458","article-title":"A unified approach to box-Mengerian hypergraphs","volume":"35","author":"Chen","year":"2010","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.ejc.2011.09.046_br000020","doi-asserted-by":"crossref","unstructured":"M. Conforti, G. Cornu\u00e9jols, Clutters that pack and the max flow min cut property: a conjecture, in: W.R. Pulleyblank, F.B. Shepherd (Eds.), The Fourth Bellairs Workshop on Combinatorial Optimization, 1993.","DOI":"10.21236\/ADA277340"},{"key":"10.1016\/j.ejc.2011.09.046_br000025","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s004930070028","article-title":"A theorem of Truemper","volume":"20","author":"Conforti","year":"2000","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2011.09.046_br000030","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717105","article-title":"Combinatorial Optimization: Packing and Covering","author":"Cornu\u00e9jols","year":"2001"},{"key":"10.1016\/j.ejc.2011.09.046_br000035","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/PL00011389","article-title":"The packing property","volume":"89","author":"Cornu\u00e9jols","year":"2000","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejc.2011.09.046_br000040","first-page":"88","article-title":"A min\u2013max relation for submodular functions on graphs","volume":"1","author":"Edmonds","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.ejc.2011.09.046_br000045","first-page":"59","article-title":"On 2-partitionable clutters and the MFMC property","volume":"2","author":"Flores-M\u00e9ndez","year":"2008","journal-title":"Advances and Applications in Discrete Mathematics"},{"key":"10.1016\/j.ejc.2011.09.046_br000050","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(83)90018-3","article-title":"Hypergraphes de chaines d\u2019aretes d\u2019un arbre","volume":"43","author":"Fournier","year":"1983","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ejc.2011.09.046_br000055","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0095-8956(85)90088-7","article-title":"The edge intersection graphs of paths in a tree","volume":"38","author":"Golumbic","year":"1985","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"10.1016\/j.ejc.2011.09.046_br000060","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.jpaa.2009.05.002","article-title":"Embedded associated primes of powers of square- free monomial ideals","volume":"214","author":"H\u00e0","year":"2010","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/j.ejc.2011.09.046_br000065","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10801-007-0079-y","article-title":"Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers","volume":"27","author":"H\u00e0","year":"2008","journal-title":"Journal of Algebraic Combinatorics"},{"key":"10.1016\/j.ejc.2011.09.046_br000070","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","article-title":"Multicommodity network flows","volume":"11","author":"Hu","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/j.ejc.2011.09.046_br000075","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0112059","article-title":"A solution of the Shannon switching game","volume":"12","author":"Lehman","year":"1964","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"10.1016\/j.ejc.2011.09.046_br000080","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01588263","article-title":"On the width-length inequality","volume":"17","author":"Lehman","year":"1979","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejc.2011.09.046_br000085","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","article-title":"On two minimax theorems in graph","volume":"21","author":"Lov\u00e1sz","year":"1976","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"10.1016\/j.ejc.2011.09.046_br000090","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/j.ejc.2011.09.046_br000095","series-title":"Combinatorial Optimization. Polyhedra and Efficiency","author":"Schrijver","year":"2003"},{"key":"10.1016\/j.ejc.2011.09.046_br000100","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","article-title":"The matroids with the max-flow min-cut property","volume":"23","author":"Seymour","year":"1977","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"10.1016\/j.ejc.2011.09.046_br000105","series-title":"Matroid Decomposition","author":"Truemper","year":"1992"},{"key":"10.1016\/j.ejc.2011.09.046_br000110","doi-asserted-by":"crossref","first-page":"3513","DOI":"10.1080\/00927879508825412","article-title":"Rees algebras of edge ideals","volume":"23","author":"Villarreal","year":"1995","journal-title":"Communications in Algebra"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669812001473?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669812001473?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T12:02:42Z","timestamp":1562155362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669812001473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["S0195669812001473"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2011.09.046","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}