claw-free graph
graph without four-vertex star induced subgraph
Facts
7 properties- Instance of
- class of the graphs without certain subgraphs
- Subclass of
- fork-free graph[3]
- Does not have part
- claw graph[6]
- Maintained by WikiProject
- WikiProject Mathematics[7]
- Named after
- claw graph[2]
- Opposite of
- co-claw-free graph[4]
- Studied by
- graph theory[5]
🏷️ Also known as
en claw-free graph
de klauenfreier Graph
fa گرافهای پنجهآزاد
fr graphe sans griffe
hu karommentes gráf
ru граф без клешней
uk граф без клешень
zh-hant 爪免除圖
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- A 5 regular graph on 12 vertices.PNG ↗
- BabelNet ID
- 00399915n
- Freebase ID
- /m/02w4dk0
- Graphclasses.org ID
- gc_62
- MathWorld ID
- Claw-FreeGraph
- Microsoft Academic ID (discontinued)
- 110071963
- Wolfram Language entity code
- Entity["GraphClass", "ClawFree"]
🔗 Connections
Examples 4
Maintained by WikiProject 1
Studied by 1
Subtypes 1
Press Enter · cited answer in seconds
0 sources
Summary
claw-free graph is a class of the graphs without certain subgraphs[1].