{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:36:42Z","timestamp":1774370202415,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":11186,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1016\/0095-8956(82)90048-x","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:32:55Z","timestamp":1094653975000},"page":"276-305","source":"Crossref","is-referenced-by-count":8,"title":["Counting bridgeless graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"P","family":"Hanlon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.W","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(82)90048-X_BIB1","series-title":"Proc. 5th S.E. Conf. Combinatorics, Graph Theory, and Computing","first-page":"253","article-title":"The number of graphs of edge connectivity exactly one","author":"Bogart","year":"1974"},{"key":"10.1016\/0095-8956(82)90048-X_BIB2","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0095-8956(82)90048-X_BIB3","first-page":"142","article-title":"Enumerative combinatorial problems concerning structures","volume":"11","author":"deBruijn","year":"1963","journal-title":"Nieuw Arch. Wisk."},{"key":"10.1016\/0095-8956(82)90048-X_BIB4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0095-8956(71)90029-3","article-title":"The m\u00f6bius function and connected graphs","volume":"11","author":"Cadogan","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(82)90048-X_BIB5","first-page":"203","article-title":"Combinatorial problems in the theory of graphs, II","volume":"42","author":"Ford","year":"1956"},{"key":"10.1016\/0095-8956(82)90048-X_BIB6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0097-3165(81)90021-2","article-title":"A cycle index sum inversion theorem","volume":"30","author":"Hanlon","year":"1981","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0095-8956(82)90048-X_BIB7","unstructured":"P. Hanlon, P\u00f3lya theory with m\u00f6bius inversion, J. Austral. Math. Soc. Ser. A, to appear."},{"key":"10.1016\/0095-8956(82)90048-X_BIB8","unstructured":"P. Hanlon and R. W. Robinson, \u201cCounting 3-Connected and 3-Line-Connected Graphs,\u201d in preparation."},{"key":"10.1016\/0095-8956(82)90048-X_BIB9","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(82)90048-X_BIB10","first-page":"332","article-title":"Dissimilarity characteristic theorems for graphs","volume":"11","author":"Harary","year":"1960"},{"key":"10.1016\/0095-8956(82)90048-X_BIB11","author":"Harary","year":"1973"},{"key":"10.1016\/0095-8956(82)90048-X_BIB12","volume":"Vol. I","author":"MacMahon","year":"1915","journal-title":"Combinatory Analysis"},{"key":"10.1016\/0095-8956(82)90048-X_BIB13","doi-asserted-by":"crossref","first-page":"583","DOI":"10.2307\/1969046","article-title":"The number of trees","volume":"49","author":"Otter","year":"1948","journal-title":"Ann. of Math."},{"key":"10.1016\/0095-8956(82)90048-X_BIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02546665","article-title":"Kombinatorische Anzahlbestimmungen f\u00fcr Gruppen, Graphen und chemische Verbindungen","volume":"68","author":"P\u00f3lya","year":"1937","journal-title":"Acta Math."},{"key":"10.1016\/0095-8956(82)90048-X_BIB15","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1111\/j.1749-6632.1970.tb56486.x","article-title":"Some unusual enumeration problems","volume":"175","author":"Read","year":"1970","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"10.1016\/0095-8956(82)90048-X_BIB16","doi-asserted-by":"crossref","first-page":"433","DOI":"10.2307\/2370675","article-title":"The theory of group-reduced distributions","volume":"49","author":"Redfield","year":"1927","journal-title":"Amer. J. Math."},{"key":"10.1016\/0095-8956(82)90048-X_BIB17","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0021-9800(70)80089-8","article-title":"Enumeration of non-separable graphs","volume":"9","author":"Robinson","year":"1970","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(82)90048-X_BIB18","unstructured":"R. W. Robinson, \u201cEnumeration of Unlabeled Graphs with Connectivity and Degree Restrictions,\u201d in preparation."},{"key":"10.1016\/0095-8956(82)90048-X_BIB19","first-page":"209","article-title":"Counting edge-connected and k-edge-connected labeled graphs","volume":"1","author":"Simpson","year":"1980","journal-title":"Amer. Math. Soc. Abstracts"},{"key":"10.1016\/0095-8956(82)90048-X_BIB20","doi-asserted-by":"crossref","unstructured":"T. R. S. Walsh, Counting labeled three-connected and homeomorphically irreducible two-connected graphs, J. Combin. Theory Ser. B, to appear.","DOI":"10.1016\/0095-8956(82)90072-7"},{"key":"10.1016\/0095-8956(82)90048-X_BIB21","doi-asserted-by":"crossref","unstructured":"T. R. S. Walsh, Counting unlabeled three-connected and homeomorphically irreducible two-connected graphs, J. Combin. Theory Ser. B, to appear.","DOI":"10.1016\/0095-8956(82)90073-9"},{"key":"10.1016\/0095-8956(82)90048-X_BIB22","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1112\/jlms\/s2-18.3.397","article-title":"The k-connectedness of unlabeled graphs","volume":"18","author":"Walsh","year":"1978","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(82)90048-X_BIB23","article-title":"Some Problems in the Enumeration of Labeled Graphs","author":"Wormald","year":"1978"},{"key":"10.1016\/0095-8956(82)90048-X_BIB24","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1112\/jlms\/s2-19.1.7","article-title":"Enumeration of labeled graphs I: 3-connected graphs","volume":"19","author":"Wormald","year":"1979","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(82)90048-X_BIB25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(79)90158-4","article-title":"The exponential generating function of labeled blocks","volume":"25","author":"Wormald","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(82)90048-X_BIB26","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/jgt.3190010407","article-title":"The number of connected sparsely edged graphs","volume":"1","author":"Wright","year":"1977","journal-title":"J. Graph Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568290048X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568290048X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T03:20:21Z","timestamp":1549250421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589568290048X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["009589568290048X"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(82)90048-x","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}