---
tag: HBV4MHZTZ5
kind: concept
name: Claw
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section C
    note: adopted
    mention: wikipedia://en/325802#2B6L
    sections: [Summary]
inventory: [9DNHWEDM2C]
---

## Summary

A claw is a tree with one internal vertex and three leaves, or equivalently the complete bipartite graph $K_{1,3}$. A claw-free graph is a graph that does not have an induced subgraph that is a claw.