Fritsch graph

The Fritsch graph

Vertices| 9
Edges| 21
Radius| 2
Diameter| 2
Girth| 3
Automorphisms| 12
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

1. ↑ Fritsch, Rudolf; Fritsch, Gerda (1998). The Four-Color Theorem. New York: Springer-Verlag. doi:10.1007/978-1-4612-1720-6.

0.00

(0 votes)

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Fritsch_graph&oldid=306393"