0 citations0 referencesGoogle Scholardoi.orgDetermining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphsAnnals of Operations Research·1996·Vol. 65(1), pp. 1–20Kim Allan Andersen, John HookerRelated Papers→ On the Hull Number of Triangle-Free Graphs(2010)47 cited→ On the Steiner antipodal number of graphs(2019)4 cited→ Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees(2020)7 cited→ Bipartite Coverings and the Chromatic Number(2009)6 cited