{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:43:28Z","timestamp":1777563808221,"version":"3.51.4"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6347,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0166-218x(95)00043-q","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"387-407","source":"Crossref","is-referenced-by-count":5,"title":["Graphs with largest number of minimum cuts"],"prefix":"10.1016","volume":"65","author":[{"given":"Jen\u0151","family":"Lehel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myriam","family":"Preissmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00043-Q_BIB1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.1975.5.3.253","article-title":"The minimum number of edges and vertices in a graph with edge connectivity n and mn-bonds","volume":"5","author":"Bixby","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0166-218X(95)00043-Q_BIB2","series-title":"Studies in Discrete Optimization","first-page":"290","article-title":"A structure of all the minimum cuts of a graph","author":"Dinitz","year":"1976"},{"key":"10.1016\/0166-218X(95)00043-Q_BIB3","first-page":"117","article-title":"Propri\u00e9t\u00e9 de Helly et probl\u00e8mes de repr\u00e9sentations, probl\u00e8mes combinatoires et th\u00e9orie des graphes","author":"Duchet","year":"1978"},{"key":"10.1016\/0166-218X(95)00043-Q_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1991.185453","article-title":"Applications of a poset representation to edge connectivity and graph rigidity","author":"Gabow","year":"1991"},{"key":"10.1016\/0166-218X(95)00043-Q_BIB5","first-page":"156","article-title":"Efficient algorithm for finding all minimal edge cuts of a non-oriented graph","volume":"2","author":"Karzanov","year":"1986","journal-title":"Kibernetika"},{"key":"10.1016\/0166-218X(95)00043-Q_BIB6","first-page":"239","article-title":"Helly-hypergraphs and abstract interval structures","volume":"16-A","author":"Lehel","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(95)00043-Q_BIB7","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/24.106785","article-title":"Counting the number of minimum cuts in multiple undirected graphs","volume":"40","author":"Nagamochi","year":"1991","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0166-218X(95)00043-Q_BIB8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(72)90019-6","article-title":"A structure theorem for the consecutive ones property","volume":"12","author":"Tucker","year":"1972","journal-title":"J. Combin. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500043Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500043Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:38:30Z","timestamp":1578494310000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500043Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0166218X9500043Q"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00043-q","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}