"On covering expander graphs by hamilton cycles."

Roman Glebov, Michael Krivelevich, Tibor Szabó (2014)

> Home

Details and statistics

DOI: 10.1002/RSA.20455

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/GlebovKS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GlebovKS14
Roman Glebov, Michael Krivelevich, Tibor Szabó:
On covering expander graphs by hamilton cycles. Random Struct. Algorithms 44(2): 183-200 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.