The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard.

Krzysztof Giaro

Published in: Ars Comb. (1997)

Keyphrases

bipartite graph
maximum matching
computational complexity
minimum weight
bipartite graph matching
data sets
worst case
maximum weight
bipartite networks