Edge-disjoint spanning trees and forests of graphs
From MaRDI portal
Publication:2028071
DOI10.1016/J.DAM.2021.04.024zbMATH Open1465.05086OpenAlexW3159241932MaRDI QIDQ2028071FDOQ2028071
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
Recommendations
Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Spectra of graphs
- Title not available (Why is that?)
- 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 the resistance matrix of a graph
- 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
- Potential Theory on Distance-Regular Graphs
- Decomposition of Finite Graphs Into Forests
- On the higher-order edge toughness of a graph
- Title not available (Why is that?)
- Bounds of the number of disjoint spanning trees
- Title not available (Why is that?)
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Fractional spanning tree packing, forest covering and eigenvalues
- Shortest coverings of graphs with cycles
- Strongly balanced graphs and random graphs
- On the spanning tree packing number of a graph: A survey
- Equiarboreal graphs
- On a new cyclicity measure of graphs -- the global cyclicity index
Cited In (14)
- Edge-disjoint spanning trees for the generalized butterfly networks and their applications
- Edge-disjoint spanners in tori
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
- Title not available (Why is that?)
- On the spanning tree packing number of a graph: A survey
- Reinforcing the number of disjoint spanning trees
- On edge-disjoint spanning trees with small depths
- Tree metrics and edge-disjoint \(S\)-paths
- Resistance characterizations of equiarboreal graphs
- Title not available (Why is that?)
- On edge-disjoint spanning trees in hypercubes
- The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains
- Spanning forests of a digraph and their applications
- Connectedness of the free uniform spanning forest as a function of edge weights
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)
