A characterization of weakly bipartite graphs

被引：35
|
作者：
Guenen, B [1 ]
机构：
[1] Univ Waterloo, Fac Math, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2001年 / 83卷 / 01期
关键词：
weakly bipartite graphs; ideal clutters; binary clutters; minors;
D O I：
10.1006/jctb.2001.2051
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 Scr. B 23. 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 K-5. A proof of this conjecture is given in this paper. (C) 2001 Academic Press.
引用
收藏
页码：112 / 168
页数：57
相关论文
共 50 条
12345