In this paper we investigate the complexity of several problems concerning 2CNF formulas. At first, we show that the minimal unsatisfiability problem for 2CNF formulas can be solved in linear time. Then we prove that the problem determining if a 2CNF form