Sciweavers

IPCO
1998

A Characterization of Weakly Bipartite Graphs

14 years 1 months ago
A Characterization of Weakly Bipartite Graphs
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.
Bertrand Guenin
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 1998
Where IPCO
Authors Bertrand Guenin
Comments (0)