{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:09:37Z","timestamp":1710349777822},"reference-count":5,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6335,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,6]]},"abstract":"Abstract<\/jats:title>Itai and Rodeh [3] have proved that for any 2\u2010connected graph G<\/jats:italic> and any vertex s<\/jats:italic> \u2208 G<\/jats:italic> there are two spanning trees such that the paths from any other vertex to s<\/jats:italic> on the trees are disjoint. In this paper the result is generalized to 3\u2010connected graphs.<\/jats:p>","DOI":"10.1002\/jgt.3190130205","type":"journal-article","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:51:14Z","timestamp":1181350274000},"page":"175-188","source":"Crossref","is-referenced-by-count":106,"title":["Three tree\u2010paths"],"prefix":"10.1002","volume":"13","author":[{"given":"Avram","family":"Zehavi","sequence":"first","affiliation":[]},{"given":"Alon","family":"Itai","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"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","first-page":"180","volume-title":"Graph Algorithms","author":"Even S.","year":"1979"},{"key":"e_1_2_1_4_2","unstructured":"A.ItaiandM.Rodeh The multi\u2010tree approach to reliability in distributed networks presented at the 25th Symposium on the Foundation of Computer Science (October1984) 137\u2013147 West Palm Beach Florida"},{"key":"e_1_2_1_4_3","unstructured":"Info. and Comput."},{"key":"e_1_2_1_5_2","volume-title":"Combinatorial Problems and Exercises","author":"Lovasz L.","year":"1979"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T13:32:36Z","timestamp":1697981556000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["10.1002\/jgt.3190130205"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130205","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}