# Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs

Brandt, S.
and
Broersma, H.J.
and
Diestel, R.
and
Kriesell, M.
(2006)
*Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs.*
Combinatorica, 26
(1).
pp. 17-36.
ISSN 0209-9683

PDF
Restricted to UT campus only : Request a copy 293kB |

Abstract: | Given a function , call an -vertex graph -connected if separating off vertices requires the deletion of at least vertices whenever . This is a common generalization of vertex connectivity (when is constant) and expansion (when is linear). We show that an -connected graph contains a cycle of length linear in if is any linear function, contains a 1-factor and a 2-factor if , and contains a Hamilton cycle if . We conjecture that linear growth of suffices to imply hamiltonicity. |

Item Type: | Article |

Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |

Research Group: | |

Link to this item: | http://purl.utwente.nl/publications/63673 |

Official URL: | https://doi.org/10.1007/s00493-006-0002-5 |

Export this item as: | BibTeX EndNote HTML Citation Reference Manager |

Repository Staff Only: item control page

Metis ID: 237594