Ear‐decompositions, minimally connected matroids and rigid graphs
Work
Year: 2023
Type: article
Abstract: We prove that if the two‐dimensional rigidity matroid of a graph on at least seven vertices is connected, and is minimal with respect to this property, then has at most edges. This bound, which is be... more
Source: Journal of Graph Theory
Author Tibor Jordán
Institution Eötvös Loránd University
Cites: 14
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Civil and Structural Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $3,760
Grant ID K135421