A short proof of Guenin's characterization of weakly bipartite graphs
type: Item
instance of: scholarly article
title: A short proof of Guenin's characterization of weakly bipartite graphs
zbMATH Open document ID: 1024.05079
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/10085
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 1843831
MaRDI profile type: Publication
OpenAlex ID: W2170662028
cites work: Weakly bipartite graphs and the max-cut problem
cites work: Q3840343
cites work: A characterization of weakly bipartite graphs
cites work: Q3973409
cites work: Lehman's forbidden minor characterization of ideal 0-1 matrices
cites work: The matroids with the max-flow min-cut property
cites work: Q3973410
DOI: 10.1006/JCTB.2001.2101
author: Alexander Schrijver
description: scientific article; zbMATH DE number 1843831