Apollonian network

graph formed by subdivision of triangle faces
Thing general Q4780395
Press Enter · cited answer in seconds

Apollonian network

Summary

Key Facts

  • Apollonius of Perga is named after Apollonian network[1].
  • Apollonian network is a type of maximal planar graph[2].
  • Apollonian network is a type of k-tree[3].
  • Apollonian network is a type of uniquely colorable graph[4].
  • Apollonian network's maintained by WikiProject is recorded as WikiProject Mathematics[5].

Body

Definition and Type

Recorded subclass of include maximal planar graph[2], k-tree[3], and uniquely colorable graph[4].

Origins

Apollonius of Perga is named after Apollonian network[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Apollonian network. Retrieved May 7, 2026, from https://4ort.xyz/entity/apollonian-network
MLA “Apollonian network.” 4ort.xyz Knowledge Graph, 4ort.xyz, 7 May. 2026, https://4ort.xyz/entity/apollonian-network.
BibTeX @misc{4ortxyz_apollonian-network_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Apollonian network}}, year = {2026}, url = {https://4ort.xyz/entity/apollonian-network}, note = {Accessed: 2026-05-07}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Apollonian network — https://4ort.xyz/entity/apollonian-network (retrieved 2026-05-07)

Canonical URL: https://4ort.xyz/entity/apollonian-network · Last refreshed: