b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture.

Wu-Hsiung Lin Gerard J. Chang

Published in: Discret. Appl. Math. (2013)

Keyphrases

bipartite graph
lower bound
maximum matching
upper bound
link prediction
graph model
graph clustering
minimum weight
worst case
bipartite graph matching
maximum cardinality
edge weights
search engine
maximum weight