A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
type: Item
instance of: scholarly article
title: A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
zbMATH Open document ID: 1300.05055
author: Anthony Nixon
published in: European Journal of Combinatorics
publication date: 2014-09-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/1202.3294
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 6339686
zbMATH Keywords: theory of frameworks on surfaces
MaRDI profile type: Publication
OpenAlex ID: W2963452381
arXiv ID: 1202.3294
cites work: A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
cites work: Generic global rigidity
cites work: Q3424777
cites work: Constructive characterizations for packing and covering with trees
cites work: Q4279195
cites work: Conditions for Unique Graph Realizations
cites work: An algorithm for two-dimensional rigidity percolation: The pebble game
cites work: Connected rigidity matroids and unique realizations of graphs
cites work: Necessary conditions for the generic global rigidity of frameworks on surfaces
cites work: On graphs and rigidity of plane skeletal structures
cites work: Pebble game algorithms and sparse graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: An Inductive Construction of (2,1)-tight Graphs
cites work: Rigidity of Frameworks Supported on Surfaces
cites work: A Characterization of Generically Rigid Frameworks on Surfaces of Revolution
cites work: Q3135082
cites work: On the 2-sum in rigidity matroids
cites work: Q3986938
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: The Union of Matroids and the Rigidity of Frameworks
cites work: Q4717849
DOI: 10.1016/J.EJC.2014.05.009
description: scientific article