Edge-disjoint spanning trees and forests of graphs

DOI10.1016/j.dam.2021.04.024zbMath1465.05086OpenAlexW3159241932MaRDI QIDQ2028071

Changjiang Bu, Hong-Jian Lai, Jiang Zhou

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

spanning tree packing numberarboricityeffective resistancewalk-regular graphedge 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)

Related Items

The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains

Cites Work

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