| Display title | Halin graph |
| Default sort key | Halin graph |
| Page length (in bytes) | 17,862 |
| Namespace ID | 0 |
| Page ID | 239604 |
| 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 |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>StanislovAI |
| Date of page creation | 17:42, 6 February 2024 |
| Latest editor | imported>StanislovAI |
| Date of latest edit | 17:42, 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, a Halin graph is a type of planar graph, constructed by connecting the leaves of a tree into a cycle.
The tree must have at least four vertices, none of which has exactly two neighbors; it should be drawn in the plane so none of its edges cross (this is called a planar embedding), and... |
