Compatible Hamilton cycles in Dirac graphs


A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated theorem of Dirac from 1952 asserts that every graph on n ≥ 3 vertices with minimum degree at least n/2 is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we obtain the following strengthening of this result. Given a graph G = (V,E), an… (More)
DOI: 10.1007/s00493-016-3328-7


2 Figures and Tables

Slides referencing similar topics