Views Navigation

Today

Connectivity properties of Hamiltonian Graphs

Science Center 507 1 Oxford Street, Cambridge

Given a graph G, the “Frank number” F(G) encodes interesting connectivity properties of the graph. It is conjectured that for all cubic graphs, the Frank number is at most three. […]