Claw-free graph

Claw-free graph --- граф без клешней.

A graph [math]\displaystyle{ G }[/math] is a claw-free graph if it contains no induced subgraph isomorphic to [math]\displaystyle{ K_{1,3} }[/math].