{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:34:51Z","timestamp":1768872891066,"version":"3.49.0"},"reference-count":6,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7702,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1985,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is well known that any spanning tree of a graph can be obtained from any other by a sequence of single edge exchanges in a way that preserves, at each step, the property of being a spanning tree. We consider a variation of this problem concerning pairs of edge\u2010disjoint spanning trees. In particular, it is shown that any pair of edge\u2010disjoint spanning trees can be obtained from any other by a sequence of single edge exchanges in a way that preserves, at each step, the property of being edge\u2010disjoint spanning trees.<\/jats:p>","DOI":"10.1002\/jgt.3190090303","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:16:57Z","timestamp":1180423017000},"page":"319-324","source":"Crossref","is-referenced-by-count":21,"title":["Edge\u2010disjoint spanning trees: A connectedness theorem"],"prefix":"10.1002","volume":"9","author":[{"given":"M.","family":"Farber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Shank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1966.1082546"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0122021"},{"key":"e_1_2_1_5_2","unstructured":"D. J.Naddef oral communication."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90043-1"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1968.1082765"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190090303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090303","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T01:21:41Z","timestamp":1692580901000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190090303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["10.1002\/jgt.3190090303"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190090303","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}