Fritsch graph
| Fritsch graph | |
|---|---|
 The Fritsch graph | |
| Vertices | 9 |
| Edges | 21 |
| Radius | 2 |
| Diameter | 2 |
| Girth | 3 |
| Chromatic number | 4 |
| Chromatic index | 6 |
| Properties | planar |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Fritsch graph is a planar graph with 9 vertices and 21 edges. It was obtained by Fritsch[1] as a minimal sized counterexample to the Alfred Kempe's attempt to prove the four-color theorem.
References
- ^ Fritsch, R. and Fritsch, G. The Four-Color Theorem. New York: Springer-Verlag, 1998
.svg){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |