On k-walks in bridgeless graphs

• Main Author: Cu, Gordon Lester T.
• Format: text
• Language: English
• Published: Animo Repository 2008
• Subjects: Graph algorithms; Graph theory; Physical Sciences and Mathematics
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/2301
• Institution: De La Salle University

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.