1 paper
Kun Cheng
A well-known result of Chvátal and ErdÅs from 1972 states that a graph with connectivity not less than its independence number plus one is hamiltonian-connected. A graph G is c…