On k-step Hamiltonian graphs
For integers k 1, a (p, q)-graph G = (V, E) is said to admit an AL(k)-traversal if there exists a sequence of vertices (v1, v 2,. . .,vp) such that for each i = 1, 2, . . . , p - 1, the distance between vi and vi is k. We call a graph ¿-step Hamiltonian (or say it admits a k-step Hamiltonian tour) i...
Published in: | Journal of Combinatorial Mathematics and Combinatorial Computing |
---|---|
Main Author: | Lau G.-C.; Lee S.-M.; Schaffer K.; Tong S.-M.; Lui S. |
Format: | Article |
Language: | English |
Published: |
Charles Babbage Research Centre
2014
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906237290&partnerID=40&md5=f50a42137bc62bf7addb2626bb190766 |
Similar Items
-
A complete solution of 3-step hamiltonian grids and torus graphs
by: Lau G.-C.; Lee S.-M.; Schaffer K.; Tong S.-M.
Published: (2019) -
On Bridge Graphs with Local Antimagic Chromatic Number 3
by: Shiu W.-C.; Lau G.-C.; Zhang R.
Published: (2025) -
On Bridge Graphs with Local Antimagic Chromatic Number 3
by: Shiu, et al.
Published: (2025) -
Classification of Severity Areas in Dengue Control Strategies Using k-Nearest Neighbours (kNN)
by: Azan, et al.
Published: (2024) -
Step Length Classification Using Decision Tree Based on IMU Sensors and Body Height
by: Zaeni I.A.E.; Lestari D.; Mustika S.N.; Rif'a Anzani D.; Osman M.K.; Ahmad K.A.
Published: (2024)