How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

Anders Yeo. How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?. Graphs and Combinatorics, 15(4):481-493, 1999. [doi]

Authors

Anders Yeo

This author has not been identified. Look up 'Anders Yeo' in Google