Finding Hamilton cycles in robustly expanding digraphs

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Original language	English
Pages (from-to)	337-360
Number of pages	24
Journal	Journal of Graph Algorithms and Applications
Volume	16
DOIs	https://doi.org/10.7155/jgaa.00261
Publication status	Published - 2012

Access to Document

@article{1a5027ace85d45a0b057eca8216745c5,

title = "Finding Hamilton cycles in robustly expanding digraphs",

author = "Demetres Christofides and Peter Keevash and Daniela Kuhn and Deryk Osthus",

year = "2012",

doi = "10.7155/jgaa.00261",

language = "English",

volume = "16",

pages = "337--360",

journal = "Journal of Graph Algorithms and Applications",

issn = "1526-1719",

publisher = "Brown University",

}

TY - JOUR

T1 - Finding Hamilton cycles in robustly expanding digraphs

AU - Christofides, Demetres

AU - Keevash, Peter

AU - Kuhn, Daniela

AU - Osthus, Deryk

PY - 2012

Y1 - 2012

U2 - 10.7155/jgaa.00261

DO - 10.7155/jgaa.00261

M3 - Article

SN - 1526-1719

VL - 16

SP - 337

EP - 360

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

ER -