A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid (Q404444): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1202.3294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic global rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive characterizations for packing and covering with trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for Unique Graph Realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for two-dimensional rigidity percolation: The pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected rigidity matroids and unique realizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary conditions for the generic global rigidity of frameworks on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs and rigidity of plane skeletal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebble game algorithms and sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inductive Construction of (2,1)-tight Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigidity of Frameworks Supported on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Generically Rigid Frameworks on Surfaces of Revolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-sum in rigidity matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3986938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Union of Matroids and the Rigidity of Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717849 / rank
 
Normal rank

Latest revision as of 00:36, 9 July 2024

scientific article
Language Label Description Also known as
English
A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
scientific article

    Statements

    A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid (English)
    0 references
    0 references
    4 September 2014
    0 references
    0 references
    theory of frameworks on surfaces
    0 references
    0 references
    0 references