Finding Hamilton cycles in robustly expanding digraphs (2012)

First Author: Christofides D
Attributed to:  Graph expansion and applications funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.7155/jgaa.00261

Publication URI: https://api.elsevier.com/content/abstract/scopus_id/84979774173

Type: Journal Article/Review

Parent Publication: Journal of Graph Algorithms and Applications

Issue: 2