Edge-disjoint spanning trees and forests of graphs

DOI10.1016/J.DAM.2021.04.024MaRDI QIDQ2028071zbMATHOpenAlexFDO

Authors Jiang Zhou, Changjiang Bu, Hong-Jian Lai

Publication date 31 May 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2021.04.024

zbMATH Keywords

arboricityeffective resistancewalk-regular graphspanning tree packing numberedge toughness

Mathematics Subject Classification ID

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

Recommendations

• On the spanning tree packing number of a graph: A survey
• Reinforcing the number of disjoint spanning trees
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Spanning tree packing and 2-essential edge-connectivity
• Arboricity and spanning‐tree packing in random graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 193132 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• A recursion formula for resistance distances and its applications
• Bounds of the number of disjoint spanning trees
• Decomposition of Finite Graphs Into Forests
• Edge-Disjoint Spanning Trees of Finite Graphs
• Equiarboreal graphs
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Fractional spanning tree packing, forest covering and eigenvalues
• On a new cyclicity measure of graphs -- the global cyclicity index
• On almost distance-regular graphs
• On electric resistances for distance-regular graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• On the higher-order edge toughness of a graph
• On the resistance matrix of a graph
• On the spanning tree packing number of a graph: A survey
• Potential Theory on Distance-Regular Graphs
• Resistance characterizations of equiarboreal graphs
• Shortest coverings of graphs with cycles
• Some rules on resistance distance with applications
• Spectra of graphs
• Strongly balanced graphs and random graphs

Cited in

(14)

• Resistance characterizations of equiarboreal graphs
• Tree metrics and edge-disjoint \(S\)-paths
• scientific article; zbMATH DE number 2192218 (Why is no real title available?)
• On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
• Edge-disjoint spanners in tori
• Edge-disjoint spanning trees for the generalized butterfly networks and their applications
• Reinforcing the number of disjoint spanning trees
• On edge-disjoint spanning trees in hypercubes
• Spanning forests of a digraph and their applications
• The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains
• Connectedness of the free uniform spanning forest as a function of edge weights
• scientific article; zbMATH DE number 5499264 (Why is no real title available?)
• On the spanning tree packing number of a graph: A survey
• On edge-disjoint spanning trees with small depths

This page was built for publication: Edge-disjoint spanning trees and forests of graphs

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