all line graphs are claw-free graphs, graphs without an induced subgraph in the form of a three-leaf tree. as with claw-free graphs more generally, every connected line graph "l"("g") with an even number of edges has a perfect matching; equivalently, this means that if the underlying graph "g" has an even number of edges, its edges can be partitioned into two-edge paths.