Ear‐decompositions, minimally connected matroids and rigid graphs

DOI10.1002/jgt.23046OpenAlexW4388201599MaRDI QIDQ6144920

Tibor Jordán

Publication date: 30 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.23046

zbMATH Keywords

ear-decompositionrigid graphconnected matroidredundantly rigid graphminimally connected matroid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal critically connected matroids
• Connected rigidity matroids and unique realizations of graphs
• Independence and port oracles for matroids, with an application to computational learning theory
• Minimally globally rigid graphs
• Sufficient conditions for the global rigidity of graphs
• On graphs and rigidity of plane skeletal structures
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• On Connectivity in Matroids and Graphs
• Globally rigid graphs are fully reconstructible
• Minimally 2-connected graphs.
• Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization
• On minimally highly vertex-redundantly rigid graphs

This page was built for publication: Ear‐decompositions, minimally connected matroids and rigid graphs