Partitioning bispanning graphs into spanning trees

DOI10.1007/S11786-009-0011-ZMaRDI QIDQ626955zbMATH OpenOpenAlexFDO

Authors 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 graphedge-disjoint spanning treesnumber of spanning treesbispanning graph

Mathematics Subject Classification ID

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

Recommendations

• Partitioning bispanning graphs into spanning trees
• On the spanning trees of weighted graphs
• Maximum of k-th maximal spanning trees of a weighted graph
• Equitable partitions to spanning trees in a graph
• Weight distribution of the bases of a matroid

Cites work

• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3537694 (Why is no real title available?)
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Adjacency, inseparability, and base orderability in matroids
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Comments on bases in dependence structures
• Maximum of k-th maximal spanning trees of a weighted graph
• On the shortest spanning subtree of a graph and the traveling salesman problem
• On the spanning trees of weighted graphs
• Partitioning bispanning graphs into spanning trees
• Some properties of basic families of subsets
• TRANSVERSAL MATROIDS, BASE-ORDERABLE MATROIDS, AND GRAPHS

Cited in

(5)

• Partitioning technique for transforming perfect binary trees into single-row networks
• On the spanning trees of weighted graphs
• Weight distribution of the bases of a matroid
• Partitioning bispanning graphs into spanning trees
• scientific article; zbMATH DE number 1163560 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626955)