scientific article; zbMATH DE number 1187139

zbMATH Open0909.90264MaRDI QIDQ3840343FDOQ3840343

Authors: Bertrand Guenin 

Publication date: 8 April 1999

Title of this publication is not available (Why is that?)

Recommendations

• A characterization of weakly bipartite graphs
• A short proof of Guenin's characterization of weakly bipartite graphs
• Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour

zbMATH Keywords

labeled graphweakly bipartite graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cited In (9)

• Perfect, ideal and balanced matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• \textsc{max-cut} and containment relations in graphs
• Ideal clutters
• On bipartite graphs with weak density of some subgraphs
• Title not available (Why is that?)
• A characterization of weakly bipartite graphs
• A short proof of Guenin's characterization of weakly bipartite graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840343)