Finding all possible minimal covers

I have a relation schema R = {A, B, C} and the following functional dependencies: - A → B - A → C - B → A - B → C - C → A - C → B How many different minimal covers can I derive from this relation schema? I have found the following, but I am not really sure if those are all: - A → C - B → C - C → A - C → B Also, I am not sure if there is some rule on how to know if one has found all possible minimal covers. Thanks a lot for any help!