{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:56:19Z","timestamp":1648634179798},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":[[1991,6]]},"DOI":"10.1007\/bf01788144","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T11:32:29Z","timestamp":1119180749000},"page":"197-204","source":"Crossref","is-referenced-by-count":1,"title":["Graphs with two isomorphism classes of spanning unicyclic subgraphs"],"prefix":"10.1007","volume":"7","author":[{"given":"Preben Dahl","family":"Vestergaard","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01788144_CR1","first-page":"45","volume":"67","author":"P. Duchet","year":"1988","unstructured":"Duchet, P., Tuza, Z., Vestergaard, P.D.: Graphs In Which All Spanning Withr Edges Less Are Isomorphic. Congr. Numerantium67, 45\u201358 (1988)","journal-title":"Congr. Numerantium"},{"key":"BF01788144_CR2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BF01300525","volume":"77","author":"R. Fischer","year":"1973","unstructured":"Fischer, R.: \u00dcber Graphen mit isomorphen Ger\u00fcsten. Monatsh. Math.77, 24\u201330 (1973)","journal-title":"Monatsh. Math."},{"key":"BF01788144_CR3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01431489","volume":"204","author":"L. Friess","year":"1973","unstructured":"Friess, L.: Graphen, worin je zwei Ger\u00fcste isomorph sind. Math. Ann.204, 65\u201371 (1973)","journal-title":"Math. Ann."},{"key":"BF01788144_CR4","first-page":"121","volume":"6","author":"B.L. Hartnell","year":"1974","unstructured":"Hartnell, B.L.: On Graphs With Exactly Two Isomorphism Classes of Spanning Trees. Util. Math.6, 121\u2013137 (1974)","journal-title":"Util. Math."},{"key":"BF01788144_CR5","unstructured":"Hartnell, B.L.: The Characterization of Those Graphs whose Spanning Trees can be partitioned into Two Isomorphism Classes. Ph.D. Thesis, Faculty of Mathematics, University of Waterloo, 1974"},{"key":"BF01788144_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(88)90084-2","volume":"70","author":"P.D. Vestergaard","year":"1988","unstructured":"Vestergaard, P.D.: Graphs With One Isomorphism Class of Spanning Unicyclic Graphs. Discrete Math.70, 103\u2013108 (1988)","journal-title":"Discrete Math."},{"key":"BF01788144_CR7","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0167-5060(08)70480-1","volume":"41","author":"P.D. Vestergaard","year":"1989","unstructured":"Vestergaard, P.D.: Finite And Infinite Graphs Whose Spanning Trees Are Pairwise Isomorphic. Ann. Discrete Math.41, 421\u2013436 (1989)","journal-title":"Ann. Discrete Math."},{"key":"BF01788144_CR8","first-page":"47","volume":"24A","author":"P.D. Vestergaard","year":"1987","unstructured":"Vestergaard, P.D.: On Graphs With Prescribed Spanning Subgraphs. Ars Comb.24A, 47\u201358 (1987)","journal-title":"Ars Comb."},{"key":"BF01788144_CR9","first-page":"527","volume":"52","author":"P.D. Vestergaard","year":"1988","unstructured":"Vestergaard, P.D.: Graphs Whose One Edge Deletions Partition into Two Isomorphism Classes. Colloq. Math. Soc. Janos Bolayi52, 527\u2013540 (1988)","journal-title":"Colloq. Math. Soc. Janos Bolayi"},{"key":"BF01788144_CR10","volume-title":"Graphentheorie","author":"K. Wagner","year":"1970","unstructured":"Wagner, K.: Graphentheorie. Mannheim: Bibliographisches Institut 1970"},{"key":"BF01788144_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.21136\/CPM.1971.117710","volume":"96","author":"B. Zelinka","year":"1971","unstructured":"Zelinka, B.: Grafu, jejich\u017e v\u0161echny kostry jsou spolu isomorfni. \u010casopis pro p\u011bstov\u00e1ni matematiky,96, 33\u201340 (1971) Graphs, All of whose Spanning Trees are Isomorphic to Each Other.","journal-title":"\u010casopis pro p\u011bstov\u00e1ni matematiky"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788144.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788144\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T02:14:46Z","timestamp":1626056086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01788144"],"URL":"https:\/\/doi.org\/10.1007\/bf01788144","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}