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: | |
|---|---|
| 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 |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-3301 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-33012021-10-21T06:25:52Z On k-walks in bridgeless graphs Cu, Gordon Lester T. 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. 2008-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/2301 Bachelor's Theses English Animo Repository Graph algorithms Graph theory Physical Sciences and Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Graph algorithms Graph theory Physical Sciences and Mathematics |
| spellingShingle |
Graph algorithms Graph theory Physical Sciences and Mathematics Cu, Gordon Lester T. On k-walks in bridgeless graphs |
| description |
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. |
| format |
text |
| author |
Cu, Gordon Lester T. |
| author_facet |
Cu, Gordon Lester T. |
| author_sort |
Cu, Gordon Lester T. |
| title |
On k-walks in bridgeless graphs |
| title_short |
On k-walks in bridgeless graphs |
| title_full |
On k-walks in bridgeless graphs |
| title_fullStr |
On k-walks in bridgeless graphs |
| title_full_unstemmed |
On k-walks in bridgeless graphs |
| title_sort |
on k-walks in bridgeless graphs |
| publisher |
Animo Repository |
| publishDate |
2008 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/2301 |
| _version_ |
1772834585567035392 |