Partitioning bispanning graphs into spanning trees

DOI10.1007/s11786-009-0011-zzbMath1205.05048OpenAlexW2066130346MaRDI QIDQ626955

Matthias Baumgart

Publication date: 19 February 2011

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-009-0011-z

zbMATH Keywords

tree graphnumber of spanning treesedge-disjoint spanning treesbispanning graph

Mathematics Subject Classification ID

Trees (05C05) Partitions of sets (05A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Maximum of k-th maximal spanning trees of a weighted graph
• On the spanning trees of weighted graphs
• Adjacency, inseparability, and base orderability in matroids
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Some properties of basic families of subsets
• Comments on bases in dependence structures
• TRANSVERSAL MATROIDS, BASE-ORDERABLE MATROIDS, AND GRAPHS
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Partitioning bispanning graphs into spanning trees