- Tytuł:
- Improved Sufficient Conditions for Hamiltonian Properties
- Autorzy:
-
Bode, Jens-P.
Fricke, Anika
Kemnitz, Arnfried - Powiązania:
- https://bibliotekanauki.pl/articles/31339476.pdf
- Data publikacji:
- 2015-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
Hamiltonian
traceable
Hamiltonian-connected - Opis:
- In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity condition.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 329-334
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł