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:
Main Author: | Cu, Gordon Lester T. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2008
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/2301 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
The bandwidth of the tower graph Tm,2k
by: Lim, Yvette F., et al.
Published: (2008) -
On the vector space of a-like matrices for tadpole graphs
by: Gillesania, Chester James Kent I., et al.
Published: (2016) -
On graceful graphs
by: Paculba, Marianne S., et al.
Published: (1998) -
Square of an oriented graph
by: Macariola, Francesca, et al.
Published: (2016) -
Verification of graph programs
by: POSKITT, Christopher M.
Published: (2012)