登入選單

返回Google圖書搜尋

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

Anders Yeo

出版	Odense Universitet, Institut for Matematik og Datalogi, 1997
URL	http://books.google.com.hk/books?id=yCDtcQAACAAJ&hl=&source=gbs_api