{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:26:55Z","timestamp":1751282815233},"reference-count":30,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00004-0","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"153-172","source":"Crossref","is-referenced-by-count":16,"title":["On perfectly two-edge connected graphs"],"prefix":"10.1016","volume":"170","author":[{"given":"Ali Ridha","family":"Mahjoub","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00004-0_BIB1","doi-asserted-by":"crossref","unstructured":"M. Ba\u00efou and A.R. Mahjoub, \u2018The 2-edge connected Steiner subgraph polytope of a series-parallel graph, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/S0895480193259813"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(94)00255-H","article-title":"On two-connected subgraph polytopes","volume":"147","author":"Barahona","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/S0895480191222665","article-title":"The k-edge connected spanning subgraph polyhedron","author":"Chopra","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB4","series-title":"Combinatorial Optimization","first-page":"131","article-title":"The traveling salesman problem","author":"Christofides","year":"1979"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB5","first-page":"705","article-title":"Network synthesis with connectivity constraints \u2014 A survey","volume":"Vol. 81","author":"Christofides","year":"1981"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","article-title":"The traveling salesman problem on a graph and some related integer polyhedra","volume":"33","author":"Cornu\u00e9jols","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB7","unstructured":"R. Coullard, A. Rais, R.L. Rardin and D.K. Wagner, The 2-connected-steiner-subgraph polytope for series-parallel graphs, Report No. CC-91-23, School of Industrial Engineering, Purdue University."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB8","unstructured":"R. Coullard, A. Rais, R.L. Rardin and D.K. Wagner, The dominant of the 2-connected-steinersubgraph polytope for W4-free graphs, Report No. 91-28, School of Industrial Egineering, Purdue University."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB9","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"Dinits","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with O, 1-vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. National Bur. Stand. B"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvement in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB13","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","article-title":"Send-and-split method for minimum-concave-cost network flows","volume":"12","author":"Erikson","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01585700","article-title":"The traveling salesman problem in graphs with some excluded minors","volume":"53","author":"Fonlupt","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Can. J. Math."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","article-title":"On the relationship between the biconnectivity augmentations and traveling salesman problem","volume":"13","author":"Frederickson","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01580607","article-title":"Survivable networks, linear programming relaxations and the parsimonious property","volume":"60","author":"Goemans","year":"1993","journal-title":"Math. programming"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB18","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB19","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0403043","article-title":"Integer polyhedra arising from certain network design problems with connectivity constraints","volume":"3","author":"Gr\u00f6tschel","year":"1990","journal-title":"SIAM J. Disc. Math"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB20","series-title":"Reliability of Computer and Communication Networks","first-page":"121","article-title":"Polyhedral approach to network survivability","volume":"Vol. 5","author":"Gr\u00f6tschel","year":"1991"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB21","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0802024","article-title":"Facets for polyhedra arising in the design of communication networks with low-connectivity constraints","volume":"2","author":"Gr\u00f6tschel","year":"1992","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB22","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","article-title":"Computational results with a cutting plane algorithm for designing communication networks with low connectivity constraints","volume":"40","author":"Gr\u00f6tschel","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB23","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01582572","article-title":"Two-edge connected spanning subgraphs and polyhedra","volume":"64","author":"Mahjoub","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB25","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585735","article-title":"Minimum-weight two connected spanning networks","volume":"46","author":"Monma","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB26","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800300107","article-title":"The traveling salesman problem: an update of research","volume":"30","author":"Parker","year":"1983","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0012-365X(96)00004-0_BIB27","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","article-title":"The design of minimum cost survivable networks","volume":"16","author":"Steiglitz","year":"1969","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB28","article-title":"Design of Survivable Networks","volume":"Vol. 1531","author":"Stoer","year":"1992"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB29","series-title":"Proc. 12th Internat. Symp. on Mathematical Programming","article-title":"Generalized Steiner problem in Halin networks","author":"Winter","year":"1985"},{"key":"10.1016\/S0012-365X(96)00004-0_BIB30","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0196-6774(86)90018-0","article-title":"Generalized Steiner problem in series-parallel networks","volume":"7","author":"Winter","year":"1986","journal-title":"J. Algorithms"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000040?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000040?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T15:27:01Z","timestamp":1553182021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96000040"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00004-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}