Fritsch graph

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.

Fritsch graph
The Fritsch graph
Vertices9
Edges21
Radius2
Diameter2
Girth3
Chromatic number4
Chromatic index6
Propertiesplanar
Table of graphs and parameters

References
  1. Fritsch, R. and Fritsch, G. The Four-Color Theorem. New York: Springer-Verlag, 1998


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.