Geodesic
Equitable partitions to spanning trees in a graph
The electronic journal of combinatorics, Tome 18 (2011) no. 1

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl
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.
DOI : 10.37236/708
Classification : 05C70, 05B35, 05C05
Mots-clés : disjoint spanning trees, base partitions of matroids 
Zsolt Fekete; Jácint Szabó. Equitable partitions to spanning trees in a graph. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/708
@article{10_37236_708,
     author = {Zsolt Fekete and J\'acint Szab\'o},
     title = {Equitable partitions to spanning trees in a graph},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/708},
     zbl = {1243.05196},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/708/}
}
TY  - JOUR
AU  - Zsolt Fekete
AU  - Jácint Szabó
TI  - Equitable partitions to spanning trees in a graph
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/708/
DO  - 10.37236/708
ID  - 10_37236_708
ER  - 
%0 Journal Article
%A Zsolt Fekete
%A Jácint Szabó
%T Equitable partitions to spanning trees in a graph
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/708/
%R 10.37236/708
%F 10_37236_708

Cité par Sources :