scientific article; zbMATH DE number 1187139

MaRDI QIDQ3840343zbMATH OpenFDO

Authors Bertrand Guenin

Publication date 8 April 1999

zbMATH Keywords

labeled graphweakly bipartite graphs

Mathematics Subject Classification ID

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

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

Cited in

(9)

• A characterization of weakly bipartite graphs
• A short proof of Guenin's characterization of weakly bipartite graphs
• scientific article; zbMATH DE number 4079483 (Why is no real title available?)
• scientific article; zbMATH DE number 1093015 (Why is no real title available?)
• \textsc{max-cut} and containment relations in graphs
• scientific article; zbMATH DE number 5054167 (Why is no real title available?)
• Perfect, ideal and balanced matrices
• Ideal clutters
• On bipartite graphs with weak density of some subgraphs

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)