| Display title | Apollonian network |
| Default sort key | Apollonian network |
| Page length (in bytes) | 40,292 |
| Namespace ID | 0 |
| Page ID | 239293 |
| 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>HamTop |
| Date of page creation | 21:22, 8 February 2024 |
| Latest editor | imported>HamTop |
| Date of latest edit | 21:22, 8 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 combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three smaller triangles. Apollonian networks may equivalently be defined as the planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar... |
