Forbidden-minor characterization for the class of graphic element splitting matroids
Kiran Dalvi ; Y.M. Borse ; M.M. Shikare
Discussiones Mathematicae Graph Theory, Tome 29 (2009), p. 629-644 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

This paper is based on the element splitting operation for binary matroids that was introduced by Azadi as a natural generalization of the corresponding operation in graphs. In this paper, we consider the problem of determining precisely which graphic matroids M have the property that the element splitting operation, by every pair of elements on M yields a graphic matroid. This problem is solved by proving that there is exactly one minor-minimal matroid that does not have this property.

Publié le : 2009-01-01
EUDML-ID : urn:eudml:doc:271019 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1469,
     author = {Kiran Dalvi and Y.M. Borse and M.M. Shikare},
     title = {Forbidden-minor characterization for the class of graphic element splitting matroids},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {29},
     year = {2009},
     pages = {629-644},
     zbl = {1194.05017},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1469}
}

Kiran Dalvi; Y.M. Borse; M.M. Shikare. Forbidden-minor characterization for the class of graphic element splitting matroids. Discussiones Mathematicae Graph Theory, Tome 29 (2009) pp. 629-644. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1469/

[000] [1] G. Azadi, Generalized splitting operation for binary matroids and related results (Ph.D. Thesis, University of Pune, 2001).

[001] [2] Y.M. Borse, M.M. Shikare and Kiran Dalvi, Excluded-Minor characterization for the class of Cographic Splitting Matroids, Ars Combin., to appear.

[002] [3] H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 1 (North Holland, Amsterdam, 1990). | Zbl 0792.05091

[003] [4] A. Habib, Some new operations on matroids and related results (Ph.D. Thesis, University of Pune, 2005).

[004] [5] F. Harary, Graph Theory (Addison-Wesley, Reading, 1969).

[005] [6] J.G. Oxley, Matroid Theory (Oxford University Press, Oxford, 1992).

[006] [7] T.T. Raghunathan, M.M. Shikare and B.N. Waphare, Splitting in a binary matroid, Discrete Math. 184 (1998) 267-271, doi: 10.1016/S0012-365X(97)00202-1. | Zbl 0955.05022

[007] [8] A. Recski, Matroid Theory and Its Applications (Springer Verlag, Berlin, 1989).

[008] [9] M.M. Shikare and G. Azadi, Determination of the bases of a splitting matroid, European J. Combin. 24 (2003) 45-52, doi: 10.1016/S0195-6698(02)00135-X. | Zbl 1014.05018

[009] [10] M.M. Shikare, Splitting lemma for binary matroids, Southeast Asian Bull. Math. 32 (2007) 151-159. | Zbl 1199.05034

[010] [11] M.M. Shikare and B.N. Waphare, Excluded-Minors for the class of graphic splitting matroids, Ars Combin., to appear. | Zbl 1249.05048

[011] [12] P.J. Slater, A classification of 4-connected graphs, J. Combin. Theory 17 (1974) 281-298, doi: 10.1016/0095-8956(74)90034-3. | Zbl 0298.05136

[012] [13] W.T. Tutte, A theory of 3-connected graphs, Indag. Math. 23 (1961) 441-455. | Zbl 0101.40903

[013] [14] D.J.A. Welsh, Matroid Theory (Academic Press, London, 1976).