On k-walks in bridgeless graphs
Date of Publication
2008
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics with specialization in Business Applications
Subject Categories
Physical Sciences and Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Alana Margarita R. Hernandez
Defense Panel Chair
Isagani B. Jos
Defense Panel Member
Mark Anthony A. Garcia
Ponsones B. Rigor
Abstract/Summary
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.
Abstract Format
html
Language
English
Format
Accession Number
TU15412
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
vii, 308 leaves ; ill. ; 28 cm.
Keywords
Graph algorithms; Graph theory
Recommended Citation
Cu, G. T. (2008). On k-walks in bridgeless graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/2301
