Linear forests and ordered cycles

Guantao Chen, et al. "Linear forests and ordered cycles." Discussiones Mathematicae Graph Theory 24.3 (2004): 359-372. <http://eudml.org/doc/270240>.

@article{GuantaoChen2004,
abstract = {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.},
author = {Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda Lesniak, Florian Pfender},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {hamilton cycles; graph linkages; Hamilton cycles},
language = {eng},
number = {3},
pages = {359-372},
title = {Linear forests and ordered cycles},
url = {http://eudml.org/doc/270240},
volume = {24},
year = {2004},
}

TY - JOUR
AU - Guantao Chen
AU - Ralph J. Faudree
AU - Ronald J. Gould
AU - Michael S. Jacobson
AU - Linda Lesniak
AU - Florian Pfender
TI - Linear forests and ordered cycles
JO - Discussiones Mathematicae Graph Theory
PY - 2004
VL - 24
IS - 3
SP - 359
EP - 372
AB - 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.
LA - eng
KW - hamilton cycles; graph linkages; Hamilton cycles
UR - http://eudml.org/doc/270240
ER -