Graph Toughness Calculator

Chvátal's Hamiltonian measure

All Tools

Loading tool...

About Graph Toughness Calculator

A graph toughness calculator computing t(G) = min over cut sets S of |S|/ω(G-S). Chvátal's parameter. t ≥ 1 necessary for Hamiltonian. t(K_n) = ∞. Chvátal conjecture: t ≥ 2 implies Hamiltonian (open!). NP-hard. Client-side.

Graph Toughness Calculator Features

  • t(G)
  • |S|/ω
  • Chvátal
  • Ham ≥ 1
  • Common graphs
Advertisement
Advertisement