Equitable partitions to spanning trees in a graph

zbMath1243.05196MaRDI QIDQ665739

Zsolt Fekete, Jácint Szabó

Publication date: 6 March 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p221.html

zbMATH Keywords

base partitions of matroidsdisjoint spanning trees

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

Serial exchanges in matroids ⋮ Fair representation in the intersection of two matroids ⋮ Unique square property, equitable partitions, and product-like graphs ⋮ Exchange Distance of Basis Pairs in Split Matroids ⋮ Equitable partitions into matchings and coverings in mixed graphs

This page was built for publication: Equitable partitions to spanning trees in a graph