- Tytuł:
- Linear forests and ordered cycles
- Autorzy:
-
Chen, Guantao
Faudree, Ralph
Gould, Ronald
Jacobson, Michael
Lesniak, Linda
Pfender, Florian - Powiązania:
- https://bibliotekanauki.pl/articles/744529.pdf
- Data publikacji:
- 2004
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
hamilton cycles
graph linkages - Opis:
- A collection $L = P¹ ∪ P² ∪ ... ∪ P^t$ (1 ≤ t ≤ k) of t disjoint paths, s of them being singletons with |V(L)| = k is called a (k,t,s)-linear forest. A graph G is (k,t,s)-ordered if for every (k,t,s)-linear forest L in G there exists a cycle C in G that contains the paths of L in the designated order as subpaths. If the cycle is also a hamiltonian cycle, then G is said to be (k,t,s)-ordered hamiltonian. We give sharp sum of degree conditions for nonadjacent vertices that imply a graph is (k,t,s)-ordered hamiltonian.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2004, 24, 3; 359-372
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł