Penny graph
Summary
A penny graph is the contact graph of a set of equal coins lying flat on a table without overlapping. Each coin is a vertex, and two coins are joined when they touch. Penny graphs are planar graphs with maximum degree at most , and they are a test case for questions about unit distances and circle packings.
Further reading
About this page
| Tag | 6DG5BBQPRA |
|---|---|
| URI | m2://6DG5BBQPRA |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C62, 52C15, 52C10 |
| Specializes | Planar graph |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.