![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/f/f5/Golomb_Lombardi.svg/640px-Golomb_Lombardi.svg.png&w=640&q=50)
Golomb graph
Undirected unit-distance graph requiring four colors / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Golomb graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In graph theory, the Golomb graph is a polyhedral graph with 10 vertices and 18 edges. It is named after Solomon W. Golomb, who constructed it (with a non-planar embedding) as a unit distance graph that requires four colors in any graph coloring. Thus, like the simpler Moser spindle, it provides a lower bound for the Hadwiger–Nelson problem: coloring the points of the Euclidean plane so that each unit line segment has differently-colored endpoints requires at least four colors.[1]
Quick Facts Named after, Vertices ...
Golomb graph | |
---|---|
![]() | |
Named after | Solomon W. Golomb |
Vertices | 10 |
Edges | 18 |
Automorphisms | 6 |
Chromatic number | 4 |
Properties | |
Table of graphs and parameters |
Close