On k-walks in bridgeless graphs

• المؤلف الرئيسي: Cu, Gordon Lester T.
• التنسيق: text
• اللغة: English
• منشور في: Animo Repository 2008
• الموضوعات: Graph algorithms; Graph theory; Physical Sciences and Mathematics
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/etd_bachelors/2301

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.