Sparse pseudo-random graphs are Hamiltonian

Krivelevich, Michael; Sudakov, Benny

doi:10.1002/jgt.10065

Record: found
Abstract: not found
Article: not found

Sparse pseudo-random graphs are Hamiltonian

Author(s): Michael Krivelevich , Benny Sudakov

Publication date Created: January 2003

Publication date (Print): January 2003

Journal: Journal of Graph Theory

Publisher: Wiley-Blackwell

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Related collections

Author and article information

Journal

Title: Journal of Graph Theory

Abbreviated Title: J. Graph Theory

Publisher: Wiley-Blackwell

ISSN (Print): 0364-9024

ISSN (Electronic): 1097-0118

Publication date Created: January 2003

Publication date (Print): January 2003

Volume: 42

Issue: 1

Pages: 17-33

Article

DOI: 10.1002/jgt.10065

SO-VID: 884fa8ee-c8e9-477a-bfc6-c5721acb5ad9

License:

http://doi.wiley.com/10.1002/tdm_license_1.1

History

Data availability:

Comments

Comment on this article

scite_

Cited by 33

See all cited by

Sparse pseudo-random graphs are Hamiltonian

Read this article at

Abstract

Related collections

Exponential Random Graph Models

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 2,673

Cited by 33