Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
40
click to vote
IPCO
1998
favorite
Email
discuss
report
125
views
Optimization
»
more
IPCO 1998
»
A Characterization of Weakly Bipartite Graphs
14 years 26 days 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
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)
Researcher Info
Optimization Study Group
Computer Vision