Regular Matroids with Graphic Cocircuits

Konstantinos Papalamprou
(London School of Economics)
Leonidas Pitsoulis
(Aristotle University of Thessaloniki)

We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we provide an algorithm which determines whether a cographic matroid with graphic cocircuits is signed-graphic or not.

In Evangelos Markakis and Ioannis Milis: Proceedings Fourth Athens Colloquium on Algorithms and Complexity (ACAC 2009), Athens, Greece, August 20-21, 2009, Electronic Proceedings in Theoretical Computer Science 4, pp. 29–41.
Published: 30th September 2009.

ArXived at: http://dx.doi.org/10.4204/EPTCS.4.4 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org