{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:44:44Z","timestamp":1787319884085,"version":"build-2736575974"},"reference-count":10,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1202640"],"award-info":[{"award-number":["DMS-1202640"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We prove an ear-decomposition theorem for 4-edge-connected graphs and use it to prove that for every 4-edge-connected graph $G$ and every $r\\in V(G)$, there is a set of four spanning trees of $G$ with the following property. For every vertex in $G$, the unique paths back to $r$ in each tree are edge-disjoint. Our proof implies a polynomial-time algorithm for constructing the trees.<\/jats:p>","DOI":"10.1137\/17m1134056","type":"journal-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T13:40:48Z","timestamp":1516282848000},"page":"233-248","source":"Crossref","is-referenced-by-count":10,"title":["Four Edge-Independent Spanning Trees"],"prefix":"10.1137","volume":"32","author":[{"given":"Alexander","family":"Hoyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robin","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,1,18]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90015-6"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103434592"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703436734"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202468"},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"A. Itai and M. Rodeh,\n                      The multi-tree approach to reliability in distributed networks\n                      , in Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, pp. 137-147.","DOI":"10.1109\/SFCS.1984.715910"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-005-0240-4"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90230-S"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70504-1"},{"key":"atypb10","unstructured":"L. Schlipf and J. M. Schmidt,\n                      Edge-orders\n                      , in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017, pp. 75:1-75:14."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130205"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1134056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:53:47Z","timestamp":1787316827000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1134056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1134056"],"URL":"https:\/\/doi.org\/10.1137\/17m1134056","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}