On graphic elementary lifts of graphic matroids
From MaRDI portal
Publication:2144605
Abstract: Zaslavsky introduced the concept of lifted-graphic matroid. For binary matroids, a binary elementary lift can be defined in terms of the splitting operation. In this paper, we give a method to get a forbidden-minor characterization for the class of graphic matroids whose all lifted-graphic matroids are also graphic using the splitting operation.
Recommendations
- Forbidden-minors for the class of cographic matroids which yield the graphic element-splitting matroids
- Forbidden-minors for graphic and cographic es-splitting matroids
- Forbidden-minor characterization for the class of graphic element splitting matroids
- scientific article; zbMATH DE number 6007681
- Graphic splitting of cographic matroids
Cites work
- A table of connected graphs on six vertices
- Biased graphs. II: The three matroids
- Determination of the bases of a splitting matroid
- Eulerian graphs and related topics. Part 1, Volume 1
- Excluded-minor characterization for the class of cographic splitting matroids.
- Graphic and cographic -extensions of binary matroids
- scientific article; zbMATH DE number 5844311 (Why is no real title available?)
- scientific article; zbMATH DE number 6007681 (Why is no real title available?)
- scientific article; zbMATH DE number 6011104 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- Infinitely many excluded minors for frame matroids and for lifted-graphic matroids
- On \(n\)-connected splitting matroids
- On excluded minors for classes of graphical matroids
- On recognizing frame and lifted-graphic matroids
- Solving Rota's conjecture
- Splitting in a binary matroid
- The highly connected matroids in minor-closed classes
- When does a biased graph come from a group labelling?
Cited in
(7)- Comments on ``Supersolvable frame-matroid and graphic-lift lattices by T. Zaslavsky [European Journal of Combinatorics 22 (2001) 119]
- A new matroid lift construction and an application to group-labeled graphs
- The excluded minors for the class of matroids that are graphic or bicircular lift
- Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
- Cographic splitting of graphic matroids using a set with three elements
- A note on connectivity preserving splitting operation for matroids representable over GF(p)
- Elementary lift and single element coextension of a binary gammoid
This page was built for publication: On graphic elementary lifts of graphic matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144605)