Abstract
We introduce a splitting operation for binary matroids which is a natural generalization of the splitting operation for graphs (Fleischner, 1990) and investigate some of its basic properties. Eulerian binary matroids are characterized in terms of the splitting operation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
