Claw (graph theory)
From Wikipedia, the free encyclopedia
In graph theory, claw denotes the complete bipartite graph K1,3. A graph that does not contain K1,3 as an induced subgraph is a claw-free graph. Every line graph is claw-free.
.svg/30px-Encoder_Disc_(3-Bit).svg.png){kind=small}
Interaction
- This page was last modified 20:10, 29 September 2007 by Wikipedia user David Eppstein. Based on work by Wikipedia user(s) Cdills, GregorB, Alaibot and Robert Samal.
- All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.)
Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a U.S. registered 501(c)(3) tax-deductible nonprofit charity. - About Wikipedia
- Disclaimers