Abstract
A signed graph is a pair (G,Σ) where G is a graph and Σ is a set of edges of G. A cycle of G is balanced if it contains an even number of edges of Σ, and unbalanced otherwise. A blocking pair of (G,Σ) is a pair of vertices {s,t} such that every unbalanced cycle intersects at least one of s or t. In this paper, we characterize when the blocking pairs of a signed graph can be represented by 2-cuts in an auxiliary graph. We discuss the relevance of this result to the problem of recognizing even cycle matroids and to the problem of characterizing signed graphs with no −K5 minor.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
