| Display title | Block graph |
| Default sort key | Block graph |
| Page length (in bytes) | 8,389 |
| Namespace ID | 0 |
| Page ID | 239332 |
| 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>Sherlock |
| Date of page creation | 11:33, 24 October 2022 |
| Latest editor | imported>Sherlock |
| Date of latest edit | 11:33, 24 October 2022 |
| 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 combinatorial mathematics, a block graph or clique tree
is a type of undirected graph in which every biconnected component (block) is a clique.
Block graphs are sometimes erroneously called Husimi trees (after Kôdi Husimi), but that name more properly refers to cactus graphs... |
