The Library
A proof of the dense version of Lovász conjecture
Tools
Christofides, Demetres, Hladký, Jan and Máthé, Andras (2011) A proof of the dense version of Lovász conjecture. Electronic Notes in Discrete Mathematics, Vol.38 . pp. 285-290. doi:10.1016/j.endm.2011.09.047 ISSN 1571-0653.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.endm.2011.09.047
Abstract
We prove that every sufficiently large dense connected vertex-transitive graph is Hamiltonian.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | Electronic Notes in Discrete Mathematics | ||||
Publisher: | Elsevier BV | ||||
ISSN: | 1571-0653 | ||||
Official Date: | 2011 | ||||
Dates: |
|
||||
Volume: | Vol.38 | ||||
Page Range: | pp. 285-290 | ||||
DOI: | 10.1016/j.endm.2011.09.047 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |