Results 251 to 260 of about 617,805 (269)
Some of the next articles are maybe not open access.
Choosability of bipartite graphs
Ars Comb., 1996A graph is called \(k\)-choosable if for any assignment of lists of size at least \(k\) to the vertices, it is possible to properly color the graph so that every vertex receives a color from its list. Let \(n(k)\) be the smallest number of vertices of a bipartite non-\(k\)-choosable graph. It was proved by \textit{P. Erdős, A. L. Rubin}, and \textit{H.
Denis Hanson +2 more
openaire +2 more sources
Co-Clustering on Bipartite Graphs for Robust Model Fitting
IEEE Transactions on Image Processing, 2022Yan Yan, Hanzi Wang, Hailing Luo
exaly
Efficient Biclique Counting in Large Bipartite Graphs
2023Rong-Hua Li, Guoren Wang, Xiaowei Ye
exaly
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
SIAM Journal on Computing, 1973Richard M. Karp
exaly
Weakly bipartite graphs and the Max-cut problem
Operations Research Letters, 1981M Grötschel, W R Pulleyblank
exaly
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
Computational and Mathematical Organization Theory, 2004Garry Robins
exaly