On matroid separations of graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(20)- Multipartite separability of Laplacian matrices of graphs
- Boolean techniques for matroidal decomposition of independence systems and applications to graphs
- Separation par une droite dans les matroïdes orientés de rang 3. (Separation of oriented matroids of rang 3 by a line)
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- Chords and disjoint paths in matroids
- Note on inseparability graphs of matroids having exactly one class of orientations
- Adjacency, inseparability, and base orderability in matroids
- On a matroid defined by ear-decompositions of graphs
- An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
- On Rota's conjecture and nested separations in matroids
- On the interplay between graphs and matroids
- A characterization of graphic matroids which yield biographic splittings matroids.
- Intertwining connectivity in matroids
- CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS
- Bridging Separations in Matroids
- scientific article; zbMATH DE number 5585143 (Why is no real title available?)
- Inseparability graphs of oriented matroids
- Separations of sets
- The structure of 2-separations of infinite matroids
- The structure of crossing separations in matroids
This page was built for publication: On matroid separations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3797188)