Cographic splitting of graphic matroids using a set with three elements
From MaRDI portal
Publication:6133667
DOI10.1007/S00373-023-02692-2zbMATH Open1519.05046OpenAlexW4385810051MaRDI QIDQ6133667FDOQ6133667
Author name not available (Why is that?)
Publication date: 21 August 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02692-2
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eulerian graphs and related topics. Part 1, Volume 1
- A characterization of graphic matroids which yield biographic splittings matroids.
- Splitting in a binary matroid
- On graphic elementary lifts of graphic matroids
Recommendations
- The structure of the 3-separations of 3-connected matroids π π
- A splitter theorem on 3-connected matroids π π
- The structure of a 3-connected matroid with a 3-separating set of essential elements π π
- The structure of equivalent 3-separations in a 3-connected matroid π π
- On 3-connected es-splitting binary matroids π π
- Graphic splitting of cographic matroids π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: Cographic splitting of graphic matroids using a set with three elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133667)