Degree sequence realizations with given packing and covering of spanning trees

DOI10.1016/j.dam.2014.11.023zbMath1310.05174OpenAlexW2070078485MaRDI QIDQ2341721

Yanyan Li

Publication date: 28 April 2015

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

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

zbMATH Keywords

spanning tree packing numberarboricitygraphic degree sequence

Mathematics Subject Classification ID

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

Related Items (1)

On constructing rational spanning tree edge densities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree sequences and graphs with disjoint spanning trees
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Connectivity and edge-disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• Decomposition of Finite Graphs Into Forests
• On the spanning tree packing number of a graph: A survey

This page was built for publication: Degree sequence realizations with given packing and covering of spanning trees