# Dong Ye

Cyclability and Linkage for Graphs with Local Conditions

Date: 11/9/2018

Time: 3:30PM-4:30PM

Place: 315 Armstrong Hall

**Abstract**: A graph G is k-cyclable if for any given k vertices, G has a cycle through all the given k vertices. It is well known that a k-connected graph is k-cyclable. A graph G is k-ordered or C_k-linked if for any give k vertices in an ordering, G has a cycle through all the given k vertices in the ordering. More general, a graph in H-linked if there is a injective map f which maps vertices of H to G such that G has a subgraph homeomorphic to H and rooted at f(V(H)). In this talk, we present some results on cyclability and linkage for graphs with extra local conditions, such as, claw-free and locally Hamiltonian etc.

All are welcome.