Highly connected rigidity matroids have unique underlying graphs

DOI10.1016/j.ejc.2012.09.001zbMath1256.05041OpenAlexW1992629164MaRDI QIDQ691582

Tibor Jordán, Viktória E. Kaszanitzky

Publication date: 3 December 2012

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.09.001

zbMATH Keywords

d-dimensional generic rigidity matroidvertical matroid connectivity

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (2)

Count and cofactor matroids of highly connected graphs ⋮ Graph reconstruction from unlabeled edge lengths

This page was built for publication: Highly connected rigidity matroids have unique underlying graphs