{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T02:09:36Z","timestamp":1768874976601,"version":"3.49.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper we first prove that if the edge set of an undirected graph is the disjoint union of two of its spanning trees, then for every subset $P$ of edges there exists a spanning tree decomposition that cuts $P$ into two (almost) equal parts. The main result of the paper is a further extension of this claim: If the edge set of a graph is the disjoint union of two of its spanning trees, then for every stable set of vertices of size 3, there exists such a spanning tree decomposition that cuts the stars of these vertices into (almost) equal parts. This result fails for 4 instead of 3. The proofs are elementary.<\/jats:p>","DOI":"10.37236\/708","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:39:35Z","timestamp":1578695975000},"source":"Crossref","is-referenced-by-count":7,"title":["Equitable Partitions to Spanning Trees in a Graph"],"prefix":"10.37236","volume":"18","author":[{"given":"Zsolt","family":"Fekete","sequence":"first","affiliation":[]},{"given":"J\u00e1cint","family":"Szab\u00f3","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2011,11,21]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p221\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p221\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T17:58:58Z","timestamp":1579283938000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/708","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,21]]},"article-number":"P221"}}