Balancing two spanning trees

DOI10.1002/NET.20405MaRDI QIDQ3087621zbMATH OpenOpenAlexFDO

Authors Matthias Kriesell

Publication date 16 August 2011

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20405

zbMATH Keywords

balancefactorizationhenneberg sequencespanning treetree packing

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Globally balancing spanning trees
• Spanning trees with many leaves
• Spanning trees with many leaves
• Factorizations of \(K_{m,n}\) into spanning trees
• Equitable partitions to spanning trees in a graph

Cites work

• Connected (g,f)-factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• scientific article; zbMATH DE number 30657 (Why is no real title available?)
• scientific article; zbMATH DE number 5499264 (Why is no real title available?)
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• On Hamiltonian Circuits
• On the Problem of Decomposing a Graph into n Connected Factors

Cited in

(4)

• Globally balancing spanning trees
• Balancing connected colourings of graphs
• Partitioning bispanning graphs into spanning trees
• Completely independent spanning trees in torus networks

This page was built for publication: Balancing two spanning trees

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