Elsevier

Discrete Mathematics

Volume 340, Issue 12, December 2017, Pages 2889-2899
Discrete Mathematics

Signed-graphic matroids with all-graphic cocircuits

https://doi.org/10.1016/j.disc.2017.07.026Get rights and content
Under an Elsevier user license
open archive

Abstract

A matroid M has all-graphic cocircuits if MY is a graphic matroid for every cocircuit YC(M). In Papalamprou and Pitsoulis (2013) it has been shown that signed-graphic matroids that are representable in GF(2) can be decomposed into graphic matroids and matroids with all-graphic cocircuits. In this paper we study this class of signed-graphic matroids with all-graphic cocircuits and provide the set of regular excluded minors as well as a complete characterization when the matroid is cographic, which in turn results in a simple recognition algorithm.

Keywords

Signed graphs
Recognition algorithm
All-graphic cocircuits

Cited by (0)

An extended abstract version of this work has appeared on Electronic Proceedings on Theoretical Computer Science, Vol. 4, 2009, pp. 29–41.