Pancyclicity when each cycle must pass exactly k Hamilton cycle chords.
Chaouche, FA, Rutherford, CG and Whitty, R (2015). Pancyclicity when each cycle must pass exactly k Hamilton cycle chords. Discussiones Mathematicae Graph Theory. 35 (3), pp. 533-539.
|Authors||Chaouche, FA, Rutherford, CG and Whitty, R|
It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, Θ(n) chords are required. A possibly ‘intermediate’ variation is the following: given k, 1 ≤ k ≤ n, how many chords must be added to ensure that there exist cycles of every possible length each of which
|Journal||Discussiones Mathematicae Graph Theory|
|Journal citation||35 (3), pp. 533-539|
|Publisher||London South Bank University|
|Digital Object Identifier (DOI)||doi:10.7151/dmgt.1818|
|30 Sep 2015|
|Publication process dates|
|Deposited||19 Dec 2017|
|Accepted||30 Sep 2015|
|Accepted author manuscript|
CC BY-NC-ND 4.0
0views this month
3downloads this month