{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:17Z","timestamp":1720640777140},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"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":[[2013,11]]},"DOI":"10.1016\/j.endm.2013.10.015","type":"journal-article","created":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T09:23:04Z","timestamp":1383556984000},"page":"95-100","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Small degree vertices in minimal bricks"],"prefix":"10.1016","volume":"44","author":[{"given":"Henning","family":"Bruhn","sequence":"first","affiliation":[]},{"given":"Maya","family":"Stein","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2013.10.015_br0010","author":"Bruhn"},{"key":"10.1016\/j.endm.2013.10.015_br0020","doi-asserted-by":"crossref","first-page":"2386","DOI":"10.1016\/j.disc.2005.12.032","article-title":"How to build a brick","volume":"306","author":"de Carvalho","year":"2006","journal-title":"Disc. Math."},{"key":"10.1016\/j.endm.2013.10.015_br0030","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579233","article-title":"Brick decomposition and the matching rank of graphs","volume":"2","author":"Edmonds","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/j.endm.2013.10.015_br0040","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(87)90021-9","article-title":"Matching structure and the matching lattice","volume":"43","author":"Lov\u00e1sz","year":"1987","journal-title":"J. Combin. Theory (Series B)"},{"key":"10.1016\/j.endm.2013.10.015_br0050","series-title":"Matching theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/j.endm.2013.10.015_br0060","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.jctb.2005.10.005","article-title":"Minimal bricks","volume":"96","author":"Norine","year":"2006","journal-title":"J. Combin. Theory (Series B)"},{"key":"10.1016\/j.endm.2013.10.015_br0070","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.jctb.2007.01.002","article-title":"Generating bricks","volume":"97","author":"Norine","year":"2007","journal-title":"J. Combin. Theory (Series B)"},{"key":"10.1016\/j.endm.2013.10.015_br0080","series-title":"Combinatorial Optimization. Polyhedra and efficiency","author":"Schrijver","year":"2003"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106531300231X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106531300231X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T22:26:29Z","timestamp":1539210389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106531300231X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":8,"alternative-id":["S157106531300231X"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2013.10.015","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}