Applications of matroid partition to tree decomposition

DOI10.1007/BF02677680zbMath0949.05061OpenAlexW116147073MaRDI QIDQ1568255

Mao-cheng Cai, Xu Dong Yuan

Publication date: 29 November 2000

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02677680

zbMATH Keywords

treepartitiondecompositionmatroid

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)

Cites Work

• Unnamed Item
• A note on the tree decompositions of graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Some Abstract Pivot Algorithms
• Two trees in maximal planar bipartite graphs
• Minimum partition of a matroid into independent subsets
• Tree decomposition

This page was built for publication: Applications of matroid partition to tree decomposition