Count and cofactor matroids of highly connected graphs
From MaRDI portal
Publication:6196151
DOI10.1016/j.jctb.2023.12.004arXiv2209.06204MaRDI QIDQ6196151
Dániel Garamvölgyi, Csaba Király, Tibor Jordán
Publication date: 14 March 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.06204
Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Connectivity (05C40)
Cites Work
- Packing of rigid spanning subgraphs and spanning trees
- Highly connected rigidity matroids have unique underlying graphs
- Research problems from the 5th Slovenian Conference (Bled, 2003)
- Connectivity in bicircular matroids
- On matroidal families
- Connected rigidity matroids and unique realizations of graphs
- The \(d\)-dimensional rigidity matroid of sparse graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On Generic Rigidity in the Plane
- BICIRCULAR MATROIDS
- Globally Rigid Augmentation of Rigid Graphs
- Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
