- Tytuł:
- Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords
- Autorzy:
-
Affif Chaouche, Fatima
Rutherford, Carrie G.
Whitty, Robin W. - Powiązania:
- https://bibliotekanauki.pl/articles/31339337.pdf
- Data publikacji:
- 2015-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
extremal graph theory
pancyclic graph
Hamilton cycle - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 3; 533-539
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł