Apollonian network
id:
apollonian-network-249-1243324
title:
Apollonian network
text:
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 graphs, and the graphs of stacked polytopes. They are named after Apollonius of Perga, who studied a related circle-packing construction.
brand slug:
wiki
category slug:
encyclopedia
description:
Graph formed by subdivision of triangles
original url:
https://en.wikipedia.org/wiki/Apollonian_network
date created:
date modified:
2023-11-07T18:15:02Z
main entity:
{"identifier":"Q4780395","url":"https://www.wikidata.org/entity/Q4780395"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/80/Apollonian-network.svg","width":407,"height":355}
fields total:
13
integrity:
15