{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:13:04Z","timestamp":1649027584411},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1007\/s00373-006-0676-x","type":"journal-article","created":{"date-parts":[[2007,1,4]],"date-time":"2007-01-04T17:25:12Z","timestamp":1167931512000},"page":"453-470","source":"Crossref","is-referenced-by-count":0,"title":["Largest Non-Unique Subgraphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Lars D\u00f8vling","family":"Andersen","sequence":"first","affiliation":[]},{"given":"Preben Dahl","family":"Vestergaard","sequence":"additional","affiliation":[]},{"given":"Zsott","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"676_CR1","unstructured":"Andersen, L.D., Tuza, Zs., Vestergaard, P.D.: Unique subgraphs versus symmetrization, in preparation"},{"key":"676_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, L.D., Vestergaard, P.D.: Graphs with all spanning trees non-isomorphic. Discrete Math. 155, 3\u201312 (1996)","DOI":"10.1016\/0012-365X(94)00363-N"},{"key":"676_CR3","unstructured":"Brigham, R.C., Dutton, R.D.: Deleted subgraph isomorphisms. Cong. Num. 110, 145\u2013152 (1995)"},{"key":"676_CR4","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E.: On the Number of Unique Subgraphs of a Graph. J. Combin. Theory (B) 18, 184\u2013185 (1975)","DOI":"10.1016\/0095-8956(75)90047-7"},{"key":"676_CR5","doi-asserted-by":"crossref","unstructured":"Desphande, M.G.: On Graphs with Unique Subgraphs. J. Combin. Theory (B) 17, 35\u201338 (1974)","DOI":"10.1016\/0095-8956(74)90044-6"},{"key":"676_CR6","unstructured":"Duchet, P., Tuza, Zs., Vestergaard, P.D.: Graphs In Which All Spanning Subgraphs With r Edges Fewer Are Isomorphic. Cong. Num. 67, 45\u201358 (1988)"},{"key":"676_CR7","doi-asserted-by":"crossref","unstructured":"Entringer, R.C., Erd\u0151s, P.: On the Number of Unique Subgraphs of a Graph. Journal of Combin. Theory (B) 13, 112\u2013115 (1972)","DOI":"10.1016\/0095-8956(72)90047-0"},{"key":"676_CR8","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: Asymmetric Graphs. Acta. Math. Hungarica 14, 295\u2013315 (1963)"},{"key":"676_CR9","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley and Sons, third edition, revised printing (1968)"},{"key":"676_CR10","doi-asserted-by":"crossref","unstructured":"Harary, F., Schwenk, A.J.: On the Number of Unique Subgraphs. J. Combin. Theory (B) 15, 156\u2013160 (1973)","DOI":"10.1016\/0095-8956(73)90015-4"},{"key":"676_CR11","unstructured":"Vestergaard, P.D.: On Graphs with Prescribed Spanning Subgraphs. Ars Combin. 24 A, 47\u201358 (1987)"},{"key":"676_CR12","doi-asserted-by":"crossref","unstructured":"Vestergaard, P.D.: Graphs With One Isomorphism Class of Spanning Unicyclic Graphs. Discrete Math. 70, 103\u2013108 (1988)","DOI":"10.1016\/0012-365X(88)90084-2"},{"key":"676_CR13","doi-asserted-by":"crossref","unstructured":"Vestergaard, P.D.: Finite and Infinite Graphs Whose Spanning Trees Are Pairwise Isomorphic. In: Andersen, L.D., Jacobsen, I.T., Thomassen, C., Toft, B. Vestergaard, P.D. (eds.) ``Graph Theory in Memory of G.A. Dirac'', North-Holland. Ann. Discrete Math. 41, 421\u2013436 (1989)","DOI":"10.1016\/S0167-5060(08)70480-1"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0676-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0676-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0676-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:26Z","timestamp":1559041106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0676-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["676"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0676-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}