Ore and Erdős type conditions for long cycles in balanced bipartite graphs.

Janusz Adamus Lech Adamus

Published in: Discret. Math. Theor. Comput. Sci. (2009)

Keyphrases

bipartite graph
maximum matching
graph model
sufficient conditions
graph clustering
minimum weight
bipartite graph matching
link prediction
data sets
mutual reinforcement
maximum cardinality
information retrieval systems
random walk
edge weights