Ear‐decompositions, minimally connected matroids and rigid graphs
DOI10.1002/JGT.23046OpenAlexW4388201599MaRDI QIDQ6144920FDOQ6144920
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Connected rigidity matroids and unique realizations of graphs
- On graphs and rigidity of plane skeletal structures
- Minimally 2-connected graphs.
- Minimally globally rigid graphs
- Sufficient conditions for the global rigidity of graphs
- Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
- Extremal critically connected matroids
- On Connectivity in Matroids and Graphs
- On minimally highly vertex-redundantly rigid graphs
- Independence and port oracles for matroids, with an application to computational learning theory
- Globally rigid graphs are fully reconstructible
- Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization
This page was built for publication: Ear‐decompositions, minimally connected matroids and rigid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144920)
