Publisher
Springer International Publishing
Reference22 articles.
1. D. Amar, E. Flandrin, I. Fournier, A. Germa, Pancyclism in Hamiltonian graphs. Discrete Math. 89, 111–131 (1991)
2. I. Anderson, Perfect matchings of a graph. J. Combin. Theory Ser. B 10, 183–186 (1971)
3. S. Brandt, Sufficient conditions for graphs to contain all subgraphs of a given type. Doctoral thesis, Freie Universität, Berlin, 1994
4. S. Brandt, Dense graphs with bounded clique number. Habilitation thesis, Freie Universität, Berlin, 2001
5. S. Brandt, R. Faudree, W. Goddard, Weakly pancyclic graphs. J. Graph Theory 27, 141–176 (1998)