The \(es\)-splitting operation for matroids representable over prime fields \(\mathrm{GF}(p)\)
From MaRDI portal
Publication:6616796
DOI10.1007/978-3-031-52969-6_1zbMATH Open1548.05074MaRDI QIDQ6616796
P. P. Malavadkar, M. M. Shikare, B. N. Waphare, Uday Jagadale, Sachin Gunjal
Publication date: 9 October 2024
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) 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?)
- A forbidden-minor characterization for the class of regular matroids which yield the cographic es-splitting matroids
- Even poset and a parity result for binary linear code
- Splitting lemma for binary matroids
- Eulerian graphs and related topics. Part 1, Volume 1
- A classification of 4-connected graphs
- Splitting in a binary matroid
- Bipartite and Eulerian minors
- Determination of the bases of a splitting matroid
- Forbidden-minors for the class of cographic matroids which yield the graphic element-splitting matroids
- A characterization of the bases of line-splitting matroids
- On 3-connected es-splitting binary matroids
- On n-connected minors of the es-splitting binary matroids
- The Closure Operator of es-Splitting Matroids
- A characterization of n-connected splitting matroids
- Connectivity in Matroids
- Lectures on matroids
- Euler and bipartite matroids
- Extension of line-splitting operation from graphs to binary matroids
This page was built for publication: The \(es\)-splitting operation for matroids representable over prime fields \(\mathrm{GF}(p)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616796)
