E-viri
Recenzirano
-
Manoussakis, Y.
Graphs and combinatorics, 08/2009, Letnik: 25, Številka: 3Journal Article
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.
