A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid

DOI10.1016/j.ejc.2014.05.009zbMath1300.05055arXiv1202.3294OpenAlexW2963452381MaRDI QIDQ404444

Anthony Nixon

Publication date: 4 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

theory of frameworks on surfaces

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

Necessary conditions for the generic global rigidity of frameworks on surfaces ⋮ Stress matrices and global rigidity of frameworks on surfaces ⋮ Global rigidity of generic frameworks on the cylinder

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary conditions for the generic global rigidity of frameworks on surfaces
• An algorithm for two-dimensional rigidity percolation: The pebble game
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Constructive characterizations for packing and covering with trees
• Connected rigidity matroids and unique realizations of graphs
• On the 2-sum in rigidity matroids
• Pebble game algorithms and sparse graphs
• Generic global rigidity
• On graphs and rigidity of plane skeletal structures
• On the Problem of Decomposing a Graph into n Connected Factors
• The Union of Matroids and the Rigidity of Frameworks
• Conditions for Unique Graph Realizations
• Rigidity of Frameworks Supported on Surfaces
• A Characterization of Generically Rigid Frameworks on Surfaces of Revolution
• An Inductive Construction of (2,1)-tight Graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid