Longest cycles in k-connected graphs with given independence number
Under an Elsevier user license
open archive
Keywords
Fouquet–Jolivet Conjecture
Circumference
Chvátal–Erdős Theorem
Connectivity
Independence number
Cited by (0)
- 1
Research partially supported by the Korean Research Foundation (MOEHRD, Basic Research Promotion Fund), grant KRF-2005-C00003.
- 2
Research partially supported by the National Security Agency under Award No. H98230-10-1-0363.
Copyright © 2011 Elsevier Inc. All rights reserved.