Highly connected rigidity matroids have unique underlying graphs

DOI10.1016/J.EJC.2012.09.001MaRDI QIDQ691582zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The \(d\)-dimensional rigidity matroid of sparse graphs
• Connected rigidity matroids and unique realizations of graphs
• Highly connected molecular graphs are rigid in three dimensions
• On the two-dimensional generic rigidity matroid and its dual
• Birigidity in the Plane

Cited in

(6)

• Highly connected molecular graphs are rigid in three dimensions
• Graph reconstruction from unlabeled edge lengths
• Ear‐decompositions, minimally connected matroids and rigid graphs
• Count and cofactor matroids of highly connected graphs
• The \(d\)-dimensional rigidity matroid of sparse graphs
• Connected rigidity matroids and unique realizations of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691582)