A **claw-free graph** is a specific type of graph in graph theory that does not contain a particular induced subgraph known as a "claw." A claw is defined as a complete bipartite graph \( K_{1,3} \), which can be visualized as a star with one central vertex connected to three other vertices. In other words, a claw consists of one vertex (the center) connected to three other vertices (the leaves), with no other connections among them.
New to topics? Read the docs here!