"Finding Hamilton cycles in robustly expanding digraphs."

Demetres Christofides et al. (2012)

> Home

Details and statistics

DOI: 10.7155/JGAA.00261

access: open

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jgaa/ChristofidesKKO12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/ChristofidesKKO12
Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus:
Finding Hamilton cycles in robustly expanding digraphs. J. Graph Algorithms Appl. 16(2): 335-358 (2012)

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.