<?xml version="1.0" encoding="US-ASCII"?>
<dblp>
<article key="journals/jgaa/ChristofidesKKO12" mdate="2021-10-14">
<author orcid="0000-0002-6371-6407">Demetres Christofides</author>
<author>Peter Keevash</author>
<author>Daniela K&#252;hn</author>
<author>Deryk Osthus</author>
<title>Finding Hamilton cycles in robustly expanding digraphs.</title>
<pages>335-358</pages>
<year>2012</year>
<volume>16</volume>
<journal>J. Graph Algorithms Appl.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.7155/jgaa.00261</ee>
<url>db/journals/jgaa/jgaa16.html#ChristofidesKKO12</url>
</article></dblp>
