for an arbitrary graph "g", and an arbitrary vertex "v" in "g", the set of edges incident to "v" corresponds to a clique in the line graph "l"("g"). the cliques formed in this way partition the edges of "l"("g"). each vertex of "l"("g") belongs to exactly two of them (the two cliques corresponding to the two endpoints of the corresponding edge in "g").