Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647471 | Discrete Mathematics | 2013 | 20 Pages |
Abstract
Dirac showed in 1952 that every graph of order nn is Hamiltonian if any vertex is of degree at least n2. This result has played an important role in extremal Hamiltonian graph theory. This paper is a survey on some recent results on generalization of Dirac’s theorem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hao Li,