Handle bases and bounds on the number of subgraphs

Berge, 1966 Brualdi, 1966, The diagonal equivalence of a nonnegative matrix to a stochastic matrix, J. Math. Anal. Appl., 16, 31, 10.1016/0022-247X(66)90184-3 Donald, 1984, A graph-theoretic upper bound on the permanent of a nonnegative integer matrix, I, Linear Algebra Appl., 61, 187, 10.1016/0024-3795(84)90030-2 Donald, 1984, A graph-theoretic upper bound on the permanent of a nonnegative integer matrix. II. The external case, Linear Algebra Appl., 61, 199, 10.1016/0024-3795(84)90031-4 J. Donald, J. Elwin, R. Hager, and P. Salamon, A suboptimal bound for the permanent of a fully indecomposable nonnegative integer matrix, in preparation. Foregger, 1975, An upper bound for the permanent of a fully indecomposable matrix, Bull. Amer. Math. Soc., 49, 319 Kevorkian, 1979, Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal, J. Graph. Theory, 3, 151, 10.1002/jgt.3190030207 Lovász, 1977, On minimal elementary bipartite graphs, J. Combin. Theory Ser. B, 23, 127, 10.1016/0095-8956(77)90062-4