The algebra of basic covers of a graph G, denoted by \A(G), was introduced by
Juergen Herzog as a suitable quotient of the vertex cover algebra. In this
paper we show that if the graph is bipartite then \A(G) is a homogeneous
algebra with straightening laws and thus is Koszul. Furthermore, we compute the
Krull dimension of \A(G) in terms of the combinatorics of G. As a consequence
we get new upper bounds on the arithmetical rank of monomial ideals of pure
codimension 2.
Given an arbitrary graph G, we study its basic covers algebra, which is the
symbolic fiber cone of the Alexander dual of the edge ideal of G. Extending
results of Villarreal and Benedetti-Constantinescu-Varbaro, valid only in the
case when G is bipartite, we characterize in a combinatorial fashion the
situations when: 1) the basic covers algebra is a domain, and 2) it is a domain
and in addition (the edge ideal of) G is unmixed.