Continuation methods for closed, weakly closed, DKT, and WDKT maps

A simple approach is presented to establish that if F is essential and F G, then G is essential. We discuss 1. (i) the case when the multivalued map has closed (or weakly closed) graph, and 2. (ii) the case when the set valued map has continuous (or weakly continuous) selections.