| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657536 | Journal of Combinatorial Theory, Series B | 2007 | 25 Pages |
Abstract
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex is obtained by taking a projective-planar signed graph or a copy of −K5 and then taking 1-, 2-, and 3-sums with balanced signed graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
