A notion of cross-perfect bipartite graphs
type: Item
instance of: scholarly article
title: A notion of cross-perfect bipartite graphs
zbMATH Open document ID: 1183.68418
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5576884
zbMATH Keywords: combinatorial problems
zbMATH Keywords: bipartite graph
zbMATH Keywords: perfect graph
zbMATH Keywords: integral polytope
author: Milind Dawande
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.08.006
OpenAlex ID: W4256170449
cites work: Q3286847
cites work: Q3941433
cites work: Q3890731
cites work: On bipartite and multipartite clique problems
cites work: Q4877294
cites work: Q4198056
cites work: Q3328583
cites work: Bicliques and eigenvalues
cites work: Approximating Clique and Biclique Problems
cites work: The dependence graph for bases in matroids
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: On the perfect graph conjecture
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Bipartite sandwiches: Semidefinite relaxations for maximum biclique
cites work: The maximum edge biclique problem is NP-complete
DOI: 10.1016/J.IPL.2003.08.006
Recommended article: Q4551380
Recommended article: Bipartite-perfect graphs
Recommended article: Q4525747
Recommended article: Bipartite graphs with a perfect matching and digraphs
Recommended article: Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
Recommended article: Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.
Recommended article: A characterization of \(b\)-perfect graphs
Recommended article: A note on the number of perfect matchings of bipartite graphs
Recommended article: Q3386067
description: scientific article; zbMATH DE number 5576884