Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords

100%

Affif Chaouche F., Rutherford C. G., Whitty R. W.

Discussiones Mathematicae Graph Theory

2015

tom 35

nr 3

533-539

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 passes exactly k chords? For fixed k, we establish a lower bound of ∩(n1/k) on the growth rate.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Affif Chaouche F.

1 Rutherford C. G.

1 Whitty R. W.

1 2015

Wyniki wyszukiwania

Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords