Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: graph linkages

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Linear forests and ordered cycles

100%

Chen G., Faudree R., Gould R., Jacobson M., Lesniak L., Pfender F.

Discussiones Mathematicae Graph Theory

2004

tom 24

nr 3

359-372

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Chen G.

1 Faudree R.

1 Gould R.

1 Jacobson M.

1 Lesniak L.

1 Pfender F.

1 2004

Wyniki wyszukiwania

Linear forests and ordered cycles