- Tytuł:
- Pancyclism and small cycles in graphs
- Autorzy:
-
Faudree, Ralph
Favaron, Odile
Flandrin, Evelynei
Li, Hao - Powiązania:
- https://bibliotekanauki.pl/articles/972039.pdf
- Data publikacji:
- 1996
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
cycle
hamiltonian
pancyclic - Opis:
- We first show that if a graph G of order n contains a hamiltonian path connecting two nonadjacent vertices u and v such that d(u)+d(v) ≥ n, then G is pancyclic. By using this result, we prove that if G is hamiltonian with order n ≥ 20 and if G has two nonadjacent vertices u and v such that d(u)+d(v) ≥ n+z, where z = 0 when n is odd and z = 1 otherwise, then G contains a cycle of length m for each 3 ≤ m ≤ max (d_C(u,v)+1, [(n+19)/13]), $d_C(u,v)$ being the distance of u and v on a hamiltonian cycle of G.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 1996, 16, 1; 27-40
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł