Spherical diagrams and labelled oriented trees

To prove that certain standard 2-complexes are aspherical we explore a strategy that combines a well-known method based on a graph theoretic lemma of Stallings with a process of reversing the orientation of edges in spherical diagrams. We apply this strategy to labelled-oriented-tree complexes and, more generally, to labelled-oriented-graph (LOG) complexes and obtain classes of aspherical LOG complexes to which, traditionally (without the reversing of edges), Stallings's lemma could not be applied to prove asphericity. These classes contain examples whose asphericity, as far as we know, could not be established by any previous method.