On k-walks in bridgeless graphs

This thesis is an exposition of the paper by Tomas Kaiser, Roman Kuzel, Hao Li, and Guanghui Wang entitled A Note on k-walks in Bridgeless Graphs . This paper shows that every bridgeless graph of maximum degree has a spanning -walk. The bound is the best possible.

Saved in:
書目詳細資料
主要作者: Cu, Gordon Lester T.
格式: text
語言:English
出版: Animo Repository 2008
主題:
在線閱讀:https://animorepository.dlsu.edu.ph/etd_bachelors/2301
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: De La Salle University
語言: English