Packing of rigid spanning subgraphs and spanning trees
type: Item
instance of: scholarly article
title: Packing of rigid spanning subgraphs and spanning trees
zbMATH Open document ID: 1300.05247
author: Joseph Cheriyan
author: Olivier Durand de Gevigney
author: Zoltán Szigeti
published in: Journal of Combinatorial Theory. Series B
publication date: 2014-08-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1201.3727
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 6334634
zbMATH Keywords: packing
zbMATH Keywords: matroid
zbMATH Keywords: rigidity
zbMATH Keywords: orientation
MaRDI profile type: Publication
OpenAlex ID: W2096249258
arXiv ID: 1201.3727
cites work: Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
cites work: Two‐connected orientations of Eulerian graphs
cites work: Q5593828
cites work: Q4871749
cites work: Connected rigidity matroids and unique realizations of graphs
cites work: A sufficient connectivity condition for generic rigidity in the plane
cites work: On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
cites work: Simultaneous well-balanced orientations of graphs
cites work: On Generic Rigidity in the Plane
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Q3491608
cites work: On the Problem of Decomposing a Graph into n Connected Factors
DOI: 10.1016/J.JCTB.2013.11.003
description: scientific article; zbMATH DE number 6334634