Ear‐decompositions, minimally connected matroids and rigid graphs
type: Item
instance of: scholarly article
title: Ear‐decompositions, minimally connected matroids and rigid graphs
author: Tibor Jordán
published in: Journal of Graph Theory
publication date: 2024-01-30T00:00:00Z
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 52B40
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 52C25
zbMATH DE Number: 7796978
zbMATH Keywords: connected matroid
zbMATH Keywords: ear-decomposition
zbMATH Keywords: minimally connected matroid
zbMATH Keywords: redundantly rigid graph
zbMATH Keywords: rigid graph
MaRDI profile type: Publication
full work available at URL: jgt.23046
OpenAlex ID: W4388201599
cites work: Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization
cites work: Independence and port oracles for matroids, with an application to computational learning theory
cites work: Minimally 2-connected graphs.
cites work: Globally rigid graphs are fully reconstructible
cites work: Minimally globally rigid graphs
cites work: Q4076414
cites work: Connected rigidity matroids and unique realizations of graphs
cites work: Q2990097
cites work: On minimally highly vertex-redundantly rigid graphs
cites work: On graphs and rigidity of plane skeletal structures
cites work: Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
cites work: Extremal critically connected matroids
cites work: On Connectivity in Matroids and Graphs
cites work: Q3135082
cites work: Sufficient conditions for the global rigidity of graphs
DOI: 10.1002/JGT.23046
description: scientific article; zbMATH DE number 7796978