The k-walks in 2K2-free graphs
After a review of Hamiltonicity of graphs and related concepts, we discuss several generalizations of Hamilton cycles: k-walks, k-trees, Hamilton-prisms and edge-dominating cycles, and investigate the relationship between them. In particular, we focus on the Jackson-Wormald conjecture and show that...
Saved in:
Main Author: | Gao, Mou |
---|---|
Other Authors: | Dmitrii V Pasechnik |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/66352 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs
by: Mou, Gao, et al.
Published: (2017) -
On k-walks in bridgeless graphs
by: Cu, Gordon Lester T.
Published: (2008) -
On extremal k-graphs without repeated copies of 2-intersecting edges
by: Ling, Alan C. H., et al.
Published: (2009) -
The bandwidth of the tower graph Tm,2k
by: Lim, Yvette F., et al.
Published: (2008) -
Linking (n - 2)-dimensional panels in n-space I: (k - 1, k)-graphs and (k - 1, k)-frames
by: Tay, T.-S.
Published: (2014)