loaded utilities
loaded invariants
loaded properties
loaded theorems
loaded graphs
Remember to load DIMACS and Sloane graphs if you want them
((is_van_den_heuvel)&(is_planar))->(is_hamiltonian)
((is_perfect)&(is_distance_regular))->(is_hamiltonian)
Blanusa Second Snark Graph
Complete graph
Cycle graph
Cycle graph
Frucht graph
alpha_critical_Bw
Petersen graph
Cycle graph
Complete bipartite graph
Complete bipartite graph
Ellingham-Horton 54-graph
Cycle graph
Graph on 5 vertices
Complete graph
p3
Graph on 7 vertices
fish
Cycle graph
Complete graph
Blanusa Second Snark Graph
Frucht graph
Heawood graph
Graph on 10 vertices
False
True
True
True
False
((is_three_connected)&(is_planar))->(is_hamiltonian)
((is_perfect)&(is_distance_regular))->(is_hamiltonian)
((is_line_graph)^(is_chordal))->(is_hamiltonian)
True
((has_paw)&(is_three_connected))->(is_hamiltonian)
((is_perfect)&(is_distance_regular))->(is_hamiltonian)
((is_line_graph)^(is_chordal))->(is_hamiltonian)
(is_hamiltonian)->(matching_covered)
(is_hamiltonian)->(is_van_den_heuvel)
(is_hamiltonian)->(is_anti_tutte)
(is_hamiltonian)->((is_distance_regular)|(is_planar))
Complete graph
True
Petersen graph
True
Cycle graph
True
Complete bipartite graph
True
Complete bipartite graph
True
Ellingham-Horton 54-graph
True
Cycle graph
True
Graph on 5 vertices
True
Complete graph
True
Path graph
True
Graph on 7 vertices
True
Graph on 6 vertices
False
Cycle graph
False
Complete graph
False
Blanusa Second Snark Graph
True
Frucht graph
True
Heawood graph
True
Graph on 10 vertices
False
Graph on 6 vertices
False
Tutte Graph
True
True
(is_hamiltonian)->((is_perfect)->(has_radius_equal_diameter))
(is_hamiltonian)->((is_independence_irreducible)|(is_distance_regular))
(is_hamiltonian)->((is_perfect)|(is_planar))
(is_hamiltonian)->((is_triangle_free)->(is_distance_regular))