| Display title | Claw-free graph |
| Default sort key | Claw-free graph |
| Page length (in bytes) | 28,652 |
| Namespace ID | 0 |
| Page ID | 229578 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image | Error creating thumbnail: Unable to save thumbnail to destination |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>WikiGary |
| Date of page creation | 21:25, 6 February 2024 |
| Latest editor | imported>WikiGary |
| Date of latest edit | 21:25, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph.
A claw is another name for the complete bipartite graph K1,3 (that is, a star graph comprising three edges, three leaves, and a central vertex). A claw-free graph is a graph in which... |
