A notion of cross-perfect bipartite graphs

DOI10.1016/j.ipl.2003.08.006zbMath1183.68418OpenAlexW4256170449MaRDI QIDQ1029000

Milind W. Dawande

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.08.006

zbMATH Keywords

bipartite graphcombinatorial problemsperfect graphintegral polytope

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On minimally non-firm binary matrices ⋮ Connected matchings in chordal bipartite graphs ⋮ Fooling-sets and rank

Cites Work

• The dependence graph for bases in matroids
• On the perfect graph conjecture
• The maximum edge biclique problem is NP-complete
• Bicliques and eigenvalues
• Normal hypergraphs and the perfect graph conjecture
• On Bipartite and Multipartite Clique Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Approximating Clique and Biclique Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A notion of cross-perfect bipartite graphs