| Display title | Pseudoforest |
| Default sort key | Pseudoforest |
| Page length (in bytes) | 30,733 |
| Namespace ID | 0 |
| Page ID | 239899 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| 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>Raymond Straus |
| Date of page creation | 15:09, 6 February 2024 |
| Latest editor | imported>Raymond Straus |
| Date of latest edit | 15:09, 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 pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that no two cycles of consecutive edges share any vertex with each other, nor can any two cycles be connected... |
