{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T23:55:57Z","timestamp":1774050957659,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"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":[[1995,6]]},"DOI":"10.1016\/0166-218x(95)e0111-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"119-129","source":"Crossref","is-referenced-by-count":9,"title":["A new approach to solving three combinatorial enumeration problems on planar graphs"],"prefix":"10.1016","volume":"60","author":[{"given":"Charles J.","family":"Colbourn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.Scott","family":"Provan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Vertigan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)E0111-3_BIB1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/opre.8.3.311","article-title":"The use of wye-delta transformations in network simplification","volume":"8","author":"Akers","year":"1960","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB2","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","article-title":"On the computational complexity of Ising spin glass models","volume":"15","author":"Barahona","year":"1982","journal-title":"J. Phys. A"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB3","series-title":"Exactly Solved Models in Statistical Mechanics","author":"Baxter","year":"1982"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB4","series-title":"Graph Theory: An Introductory Course","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB5","doi-asserted-by":"crossref","unstructured":"M.K. Chari, T.A. Feo and J.S. Provan, The delta-wye approximation procedure for two-terminal reliability, Oper. Res., to appear.","DOI":"10.1287\/opre.44.5.745"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB6","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB7","series-title":"19th ACM Symposium on the Theory of Computing","first-page":"1","article-title":"Matrix multiplication via arithmetic progressions","author":"Coppersmith","year":"1987"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(90)90293-Q","article-title":"On two dual classes of planar graphs","volume":"80","author":"Elmallah","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB9","first-page":"13","article-title":"Reduction of a plane graph to an edge by a star-triangle transformation","volume":"166","author":"Epifanov","year":"1966","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB10","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1287\/opre.41.3.572","article-title":"Delta-wye transformations and the efficient reduction of two-terminal planar graphs","volume":"41","author":"Feo","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB11","doi-asserted-by":"crossref","first-page":"1776","DOI":"10.1063\/1.1704825","article-title":"On the dimer solution of planar Ising models","volume":"7","author":"Fisher","year":"1966","journal-title":"J. Math. Phys."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02980577","article-title":"Beitrag zur Theorie des Ferromagnetismus","volume":"31","author":"Ising","year":"1925","journal-title":"Z. Phys."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01010403","article-title":"2-dimensional monomer-dimer problems are computationally intractable","volume":"48","author":"Jerrum","year":"1987","journal-title":"J. Statist. Phys."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB14","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/0222066","article-title":"Polynomial-time approximation algorithms for the Ising model","volume":"22","author":"Jerrum","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB15","series-title":"Graph Theory and Theoretical Physics","article-title":"Graph theory and crystal physics","author":"Kasteleyn","year":"1967"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB16","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1002\/andp.18471481202","article-title":"Uber die Auflosung der Gleichungen auf welche man sei der Untersuching der Linearen Verteilung Galvansicher Strome Gefuhrt wind","volume":"72","author":"Kirchoff","year":"1847","journal-title":"Poggendorg's Ann. Phys. Chem."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB17","first-page":"773","article-title":"Wye-delta transformations in probabilistic networks","volume":"11","author":"Lehman","year":"1962","journal-title":"J. SIAM"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB18","first-page":"613","article-title":"Beitrag zur Verstandnis der magnetischen Erscheinungen in fester Korpern","volume":"21","author":"Lenz","year":"1920","journal-title":"Z. Phys."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB19","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","article-title":"Generalized nested dissection","volume":"16","author":"Lipton","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB20","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB21","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/jgt.3190130202","article-title":"On the delta-wye reduction for planar graphs","volume":"13","author":"Truemper","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(95)E0111-3_BIB22","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)E0111-3_BIB23","doi-asserted-by":"crossref","unstructured":"D. Vertigan, The computational complexity of Tutte invariants for planar graphs, SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539704446797"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95E01113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95E01113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T21:55:13Z","timestamp":1555278913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X95E01113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0166218X95E01113"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)e0111-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}