On n-connected minors of the es-splitting binary matroids
From MaRDI portal
Publication:5061679
DOI10.5614/ejgta.2021.9.2.3zbMath1482.05032OpenAlexW3206208117MaRDI QIDQ5061679
Santosh Baburao Dhotre, P. P. Malavadkar, M. M. Shikare
Publication date: 14 March 2022
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2021.9.2.3
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)
Cites Work
- Unnamed Item
- Unnamed Item
- A forbidden-minor characterization for the class of regular matroids which yield the cographic es-splitting matroids
- Forbidden-minors for graphic and cographic es-splitting matroids
- Even poset and a parity result for binary linear code
- Splitting lemma for binary matroids
- A classification of 4-connected graphs
- Splitting in a binary matroid
- Bipartite and Eulerian minors
- A characterization of the bases of line-splitting matroids
- On 3-connected es-splitting binary matroids
- On the connectivity of k-distance graphs
- A characterization of n-connected splitting matroids
- Connectivity in Matroids
- Euler and bipartite matroids
- Extension of line-splitting operation from graphs to binary matroids
This page was built for publication: On n-connected minors of the es-splitting binary matroids
