Hamilton cycles, minimum degree, and bipartite holes
We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large minimum degree and without a large “bipartite hole” (two disjoint sets of vertices with no edges between them). This result extends Dirac's classical theorem, and is related to a theorem of Chvátal a...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Wiley
2017
|