A short proof of Guenin's characterization of weakly bipartite graphs

DOI10.1006/jctb.2001.2101zbMath1024.05079OpenAlexW2170662028MaRDI QIDQ1850611

Alexander Schrijver

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/10085

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Signed and weighted graphs (05C22)

Related Items (7)

Min orderings and list homomorphism dichotomies for signed and unsigned graphs ⋮ Packing odd circuits in Eulerian graphs ⋮ \textsc{max-cut} and containment relations in graphs ⋮ Ideal clutters ⋮ max-cut and Containment Relations in Graphs ⋮ Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids ⋮ Odd-\(K_{4}\)'s in stability critical graphs

Cites Work

• Lehman's forbidden minor characterization of ideal 0-1 matrices
• Weakly bipartite graphs and the max-cut problem
• The matroids with the max-flow min-cut property
• A characterization of weakly bipartite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A short proof of Guenin's characterization of weakly bipartite graphs