{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:15:54Z","timestamp":1648570554095},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"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":[[1996,8]]},"DOI":"10.1016\/0012-365x(94)00363-n","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"3-12","source":"Crossref","is-referenced-by-count":1,"title":["Graphs with all spanning trees nonisomorphic"],"prefix":"10.1016","volume":"155","author":[{"given":"Lars D\u00f8vling","family":"Andersen","sequence":"first","affiliation":[]},{"given":"Preben Dahl","family":"Vestergaard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00363-N_BIB1","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley","year":"1889","journal-title":"Quart. J. Pure Appl. Math."},{"key":"10.1016\/0012-365X(94)00363-N_BIB2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BF01300525","article-title":"\u00dcber Graphen mit isomorphen Ger\u00fcsten","volume":"77","author":"Fischer","year":"1973","journal-title":"Monatsh. Math."},{"key":"10.1016\/0012-365X(94)00363-N_BIB3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01431489","article-title":"Graphen, worin je zwei Ger\u00fcste isomorph sind","volume":"204","author":"Friess","year":"1973","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(94)00363-N_BIB4","first-page":"121","article-title":"On graphs with exactly two isomorphism classes of spanning trees","volume":"6","author":"Hartnell","year":"1974","journal-title":"Utilitas Math."},{"key":"10.1016\/0012-365X(94)00363-N_BIB5","article-title":"The characterization of those graphs whose spanning trees can be partitioned into two isomorphism classes","author":"Hartnell","year":"1974"},{"key":"10.1016\/0012-365X(94)00363-N_BIB6","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1002\/andp.18471481202","article-title":"\u00dcber die Aufl\u00f6sung der Gleichungen, auf welche man bei der Untersuchungen der linearen Verteilung galvanischer Str\u00f6me gef\u00fchrt wird","volume":"72","author":"Kirchhoff","year":"1847","journal-title":"Ann. Phys. Chem."},{"key":"10.1016\/0012-365X(94)00363-N_BIB7","series-title":"Combinatorial Enumeration of Groups, Graphs and Chemical Compounds","author":"Polya","year":"1987"},{"key":"10.1016\/0012-365X(94)00363-N_BIB8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0095-8956(81)80025-1","article-title":"Non-separating induced cycles in graphs","volume":"31","author":"Thomassen","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)00363-N_BIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(88)90084-2","article-title":"Graphs with one isomorphism class of spanning unicyclic subgraphs","volume":"70","author":"Vestergaard","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00363-N_BIB10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0167-5060(08)70480-1","article-title":"Finite and infinite graphs whose spanning trees are pairwise isomorphic","volume":"41","author":"Vestergaard","year":"1989","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(94)00363-N_BIB11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF01788144","article-title":"Graphs with two isomorphism classes of spanning unicyclic subgraphs","volume":"7","author":"Vestergaard","year":"1991","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(94)00363-N_BIB12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.21136\/CPM.1971.117710","article-title":"Grafu, jejiich\u1e91 v\u0161echny kostry jsou spolu isomorfni","volume":"96","author":"Zelinka","year":"1971","journal-title":"\u010cas. pro P\u011bst. Mat."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400363N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400363N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T06:44:25Z","timestamp":1620542665000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400363N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0012365X9400363N"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00363-n","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}