A notion of cross-perfect bipartite graphs
From MaRDI portal
Publication:1029000
DOI10.1016/J.IPL.2003.08.006zbMATH Open1183.68418OpenAlexW4256170449MaRDI QIDQ1029000FDOQ1029000
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
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Normal hypergraphs and the perfect graph conjecture
- On bipartite and multipartite clique problems
- The dependence graph for bases in matroids
- The maximum edge biclique problem is NP-complete
- On the perfect graph conjecture
- Approximating Clique and Biclique Problems
- Bipartite sandwiches: Semidefinite relaxations for maximum biclique
- Bicliques and eigenvalues
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
Recommendations
- Title not available (Why is that?) 👍 👎
- Bipartite-perfect graphs 👍 👎
- Bipartite-perfect graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Bipartite graphs with a perfect matching and digraphs 👍 👎
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs 👍 👎
- Crossing numbers of nearly complete graphs and nearly complete bipartite graphs. 👍 👎
- A characterization of \(b\)-perfect graphs 👍 👎
- A note on the number of perfect matchings of bipartite graphs 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: A notion of cross-perfect bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029000)
