| Display title | Linear forest |
| Default sort key | Linear forest |
| Page length (in bytes) | 2,378 |
| Namespace ID | 0 |
| Page ID | 240174 |
| 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 |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>TextAI |
| Date of page creation | 03:25, 26 October 2021 |
| Latest editor | imported>TextAI |
| Date of latest edit | 03:25, 26 October 2021 |
| 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, a branch of mathematics, a linear forest is a kind of forest formed from the disjoint union of path graphs. It is an undirected graph with no cycles in which every vertex has degree at most two. Linear forests are the same thing as claw-free forests. They are the graphs whose Colin de... |
