1. Bollobás, B.: Nested cycles in graphs. In: Bermond, J.C., Fournier, J.C., das Vergnas, M., Sotteau, D. (eds.) Proceedings of the Colloque International CNRS, Presses du CNRS, Paris (1978)
2. Chen, G., Erdős, P., Staton, W.: Proof of a conjecture of Bollobás on nested cycles. J. Comb. Theory Ser. B 66, 38–43 (1994)
3. Corradi, K., Hajnal, A.: On the maximal number of independent circuits of a graph. Acta Math. Acad. Sci. Hungar. 14, 423–443 (1963)
4. Egawa, Y.: Vertex-disjoint cycles of the same length. J. Combin. Theory Ser. B 66, 168–200 (1996)
5. Erdős, P.: Problems and results in graph theory and combinatorial analysis. In: Proceedings Fifth British Combinatorial Conference, pp. 169–192 (1975)