Chvátal graph
| Chvátal graph | |
|---|---|
| Named after | Václav Chvátal |
| Vertices | 12 |
| Edges | 24 |
| Radius | 2 |
| Diameter | 2 |
| Girth | 4 |
| Automorphisms | 8 (D4) |
| Chromatic number | 4 |
| Chromatic index | 4 |
| Book thickness | 3 |
| Queue number | 2 |
| Properties | Regular Hamiltonian Triangle-free Eulerian |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Chvátal graph is an undirected graph with 12 vertices and 24 edges, discovered by Václav Chvátal in 1970. It is the smallest graph that is triangle-free, 4-regular, and 4-chromatic.