A Characterization of Weakly Bipartite Graphs

13 years 5 months ago

Download homepages.cwi.nl

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

Real-time Traffic

Bipartite Graphs | Guenin's Original Proof | IPCO 1998 | IPCO 2007 |

claim paper

» Characterizations of bipartite Steinhaus graphs

» Rigidity of Graph Joins and Hendricksons Conjecture

» A Convexity Lemma and Expansion Procedures for Bipartite Graphs

» Signed analogs of bipartite graphs

» A new characterization of P6free graphs

» Polar cographs

» Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted ...

» A characterization of halved cubes

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	IPCO
Authors	Bertrand Guenin

Comments (0)

Sciweavers

A Characterization of Weakly Bipartite Graphs

Bipartite Graphs | Guenin's Original Proof | IPCO 1998 | IPCO 2007 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers