Returns the Chvátal Graph
The Chvátal Graph is an undirected graph with 12 nodes and 24 edges . It has 370 distinct (directed) Hamiltonian cycles, giving a unique generalized LCF notation of order 4, two of order 6 , and 43 of order 1 .
- create_usingNetworkX graph constructor, optional (default=nx.Graph)
Graph type to create. If graph instance, then cleared before populated.
- Gnetworkx Graph
The Chvátal graph with 12 nodes and 24 edges