Title of article
A Short Proof of Gueninʹs Characterization of Weakly Bipartite Graphs
Author/Authors
Schrijver، نويسنده , , Alexander، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
6
From page
255
To page
260
Abstract
We give a proof of Gueninʹs theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Gueninʹs original proof.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2002
Journal title
Journal of Combinatorial Theory Series B
Record number
1527015
Link To Document