Title of article
A Characterization of Weakly Bipartite Graphs
Author/Authors
Guenin، نويسنده , , Bertrand، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
57
From page
112
To page
168
Abstract
A signed graph is said to be weakly bipartite if the clutter of its odd circuits is ideal. P. D. Seymour (1977, J. Combin. Theory Ser. B23, 189–122; 1981, Europ. J. Combin. 257–290) conjectured that a signed graph is weakly bipartite if and only if it does not contain a minor called an odd K5. A proof of this conjecture is given in this paper.
Keywords
Weakly bipartite graphs , ideal clutters , minors , binary clutters
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series B
Record number
1526886
Link To Document