By a Mostowski graph, we mean a finite graph with disjoint sets A, E of vertices, with all edges directed from A to E. A number of results about Mostowski graphs are found to be useful in establishing semantic and syntactic results about branching quantifiers, which Henkin characterized as partially ordered sets of first order quantifiers, but which can better be characterized as sets of dependencies among quantifiers.