Longest Cycles in 3-connected Graphs with Given Independence Number |
| |
| Authors: | Y. Manoussakis |
| |
| Affiliation: | (1) Université Paris-Sud 11, L.R.I., Bat. 490, 91405 Orsay Cedex, France |
| |
| Abstract: | Fouquet and Jolivet conjectured that a k-connected graph of order n and independence number α ≥ k has a cycle of length at least  [Fouquet and Jolivet, Problèmes combinatoires et théorie des graphes Orsay (1976), Problems, page 438]. Here we prove this conjecture for k=3. |
| |
| Keywords: | Longest cycles 3-connected graphs Independence number |
| 本文献已被 SpringerLink 等数据库收录！ |
|
