properties of a graph "g" that depend only on adjacency between edges may be translated into equivalent properties in "l"("g") that depend on adjacency between vertices. for instance, a matching in "g" is a set of edges no two of which are adjacent, and corresponds to a set of vertices in "l"("g") no two of which are adjacent, that is, an independent set.