Abstract
The Chvátal-Erd̃os Theorem states that a 2-connected graph is hamiltonian if its independence number is bounded from above by its connectivity. In this short survey, we explore the recent development on the extensions and the variants of this theorem. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
APA
Saito, A. (2008). Chvátal-erdos theorem: Old theorem with new aspects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4535 LNCS, pp. 191–200). Springer Verlag. https://doi.org/10.1007/978-3-540-89550-3_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free