Spanning Rigid Subgraph Packing and Sparse Subgraph Covering

DOI10.1137/17M1134196zbMath1388.05152arXiv1405.0247OpenAlexW2770909773WikidataQ129725659 ScholiaQ129725659MaRDI QIDQ4568066

Xiaofeng Gu

Publication date: 15 June 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.0247

zbMATH Keywords

coveringpackingspanning treesparse graphrigid graph

Mathematics Subject Classification ID

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

Related Items (5)

Extremal graphs for a spectral inequality on edge-disjoint spanning trees ⋮ Spectral radius conditions for the rigidity of graphs ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Graph rigidity for unitarily invariant matrix norms ⋮ Spectral conditions for graph rigidity in the Euclidean plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing of rigid spanning subgraphs and spanning trees
• Decomposing a graph into forests: the nine dragon tree conjecture is true
• Decomposing a graph into forests
• A sufficient connectivity condition for generic rigidity in the plane
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Connected rigidity matroids and unique realizations of graphs
• Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
• On graphs and rigidity of plane skeletal structures
• On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The 2-dimensional rigidity of certain families of graphs
• On Generic Rigidity in the Plane
• The Rigidity of Graphs
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Spanning Rigid Subgraph Packing and Sparse Subgraph Covering