Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
A Characterization of Weakly Bipartite Graphs

A Characterization of Weakly Bipartite Graphs

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1412/1998
BookInteger Programming and Combinatorial Optimization
DOI10.1007/3-540-69346-7
Copyright1998
ISBN978-3-540-64590-0
DOI10.1007/3-540-69346-7_2
Pages9-22
Subject CollectionComputer Science
SpringerLink DateThursday, January 01, 1998
Add to marked items

A Characterization of Weakly Bipartite Graphs

Bertrand Guenin7

(7)  Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Abstract
A labeled graph is said to be weakly bipartite if the clutter of its odd cycles is ideal. Seymour conjectured that a labeled graph is weakly bipartite if and only if it does not contain a minor called an odd K 5. An outline of the proof of this conjecture is given in this paper.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.105 • Server: mpweb03
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)